./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound5.c --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/fermat1-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee7efdbf8e082fecbcf7a0b7187f01592d4dffd310592a1175678347e3e281b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:17:04,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:17:04,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:17:04,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:17:04,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:17:04,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:17:04,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:17:04,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:17:04,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:17:04,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:17:04,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:17:04,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:17:04,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:17:04,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:17:04,593 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:17:04,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:17:04,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:17:04,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:17:04,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:17:04,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:17:04,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:17:04,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:17:04,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:17:04,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:17:04,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:17:04,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:17:04,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:17:04,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:17:04,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:17:04,597 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 -> ee7efdbf8e082fecbcf7a0b7187f01592d4dffd310592a1175678347e3e281b9 [2025-03-17 15:17:04,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:17:04,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:17:04,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:17:04,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:17:04,816 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:17:04,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound5.c [2025-03-17 15:17:05,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f95f64e9/a133a6f5958746f08a569f24e3d2820c/FLAGaabb9cf84 [2025-03-17 15:17:06,131 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:17:06,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound5.c [2025-03-17 15:17:06,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f95f64e9/a133a6f5958746f08a569f24e3d2820c/FLAGaabb9cf84 [2025-03-17 15:17:06,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f95f64e9/a133a6f5958746f08a569f24e3d2820c [2025-03-17 15:17:06,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:17:06,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:17:06,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:17:06,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:17:06,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:17:06,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5a69ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06, skipping insertion in model container [2025-03-17 15:17:06,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:17:06,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:17:06,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:17:06,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:17:06,377 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:17:06,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06 WrapperNode [2025-03-17 15:17:06,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:17:06,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:17:06,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:17:06,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:17:06,383 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:17:06" (1/1) ... [2025-03-17 15:17:06,389 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:17:06" (1/1) ... [2025-03-17 15:17:06,412 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 146 [2025-03-17 15:17:06,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:17:06,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:17:06,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:17:06,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:17:06,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,435 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:17:06,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:17:06,443 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:17:06,443 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:17:06,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:17:06,444 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (1/1) ... [2025-03-17 15:17:06,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:17:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:06,477 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:17:06,482 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:17:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:17:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:17:06,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:17:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:17:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:17:06,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:17:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:17:06,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:17:06,537 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:17:06,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:17:06,968 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-17 15:17:06,968 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:17:06,981 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:17:06,983 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:17:06,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:06 BoogieIcfgContainer [2025-03-17 15:17:06,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:17:06,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:17:06,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:17:06,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:17:06,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:17:06" (1/3) ... [2025-03-17 15:17:06,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4488524b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:06, skipping insertion in model container [2025-03-17 15:17:06,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:06" (2/3) ... [2025-03-17 15:17:06,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4488524b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:06, skipping insertion in model container [2025-03-17 15:17:06,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:06" (3/3) ... [2025-03-17 15:17:06,992 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound5.c [2025-03-17 15:17:07,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:17:07,003 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_valuebound5.c that has 3 procedures, 208 locations, 1 initial locations, 3 loop locations, and 92 error locations. [2025-03-17 15:17:07,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:17:07,054 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;@51f42cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:17:07,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-03-17 15:17:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 105 states have (on average 1.9523809523809523) internal successors, (205), 197 states have internal predecessors, (205), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:17:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:17:07,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:07,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:07,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:07,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash -358080364, now seen corresponding path program 1 times [2025-03-17 15:17:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406302536] [2025-03-17 15:17:07,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:07,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:17:07,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:17:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:07,169 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:17:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406302536] [2025-03-17 15:17:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406302536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:17:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296733048] [2025-03-17 15:17:07,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:07,175 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:17:07,177 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:17:07,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:17:07,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:17:07,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:07,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:07,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:17:07,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:07,231 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:17:07,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:17:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296733048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:17:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:17:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639329411] [2025-03-17 15:17:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:17:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:07,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:17:07,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:17:07,259 INFO L87 Difference]: Start difference. First operand has 208 states, 105 states have (on average 1.9523809523809523) internal successors, (205), 197 states have internal predecessors, (205), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:17:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:07,291 INFO L93 Difference]: Finished difference Result 404 states and 447 transitions. [2025-03-17 15:17:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:17:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 13 [2025-03-17 15:17:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:07,298 INFO L225 Difference]: With dead ends: 404 [2025-03-17 15:17:07,299 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 15:17:07,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:17:07,305 INFO L435 NwaCegarLoop]: 206 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, 206 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:17:07,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:17:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 15:17:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-17 15:17:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 103 states have (on average 1.8155339805825244) internal successors, (187), 184 states have internal predecessors, (187), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 201 transitions. [2025-03-17 15:17:07,352 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 201 transitions. Word has length 13 [2025-03-17 15:17:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 201 transitions. [2025-03-17 15:17:07,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:17:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2025-03-17 15:17:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:17:07,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:07,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:07,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:17:07,556 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:17:07,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:07,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -554564078, now seen corresponding path program 1 times [2025-03-17 15:17:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:07,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627027046] [2025-03-17 15:17:07,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:07,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:17:07,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:17:07,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:07,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:07,628 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:17:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:07,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627027046] [2025-03-17 15:17:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627027046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:07,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:17:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894457015] [2025-03-17 15:17:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:07,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:17:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:07,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:17:07,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:07,630 INFO L87 Difference]: Start difference. First operand 194 states and 201 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:17:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:07,692 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2025-03-17 15:17:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:17:07,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2025-03-17 15:17:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:07,693 INFO L225 Difference]: With dead ends: 194 [2025-03-17 15:17:07,693 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 15:17:07,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:07,694 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:07,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 345 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:17:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 15:17:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-17 15:17:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 180 states have internal predecessors, (183), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 197 transitions. [2025-03-17 15:17:07,719 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 197 transitions. Word has length 13 [2025-03-17 15:17:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:07,720 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 197 transitions. [2025-03-17 15:17:07,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:17:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 197 transitions. [2025-03-17 15:17:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:17:07,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:07,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:07,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:17:07,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -11617068, now seen corresponding path program 1 times [2025-03-17 15:17:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415577470] [2025-03-17 15:17:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:07,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:17:07,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:17:07,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:07,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:07,767 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:17:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415577470] [2025-03-17 15:17:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415577470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:07,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:07,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:17:07,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630784277] [2025-03-17 15:17:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:07,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:17:07,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:07,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:17:07,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:07,768 INFO L87 Difference]: Start difference. First operand 190 states and 197 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:17:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:07,808 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2025-03-17 15:17:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:17:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-17 15:17:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:07,809 INFO L225 Difference]: With dead ends: 190 [2025-03-17 15:17:07,809 INFO L226 Difference]: Without dead ends: 186 [2025-03-17 15:17:07,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:07,810 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:07,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 345 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:17:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-17 15:17:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-17 15:17:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 103 states have (on average 1.7378640776699028) internal successors, (179), 176 states have internal predecessors, (179), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 193 transitions. [2025-03-17 15:17:07,823 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 193 transitions. Word has length 14 [2025-03-17 15:17:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:07,823 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 193 transitions. [2025-03-17 15:17:07,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:17:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2025-03-17 15:17:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 15:17:07,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:07,824 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:17:07,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:07,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 227095504, now seen corresponding path program 1 times [2025-03-17 15:17:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040169557] [2025-03-17 15:17:07,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:07,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:17:07,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:17:07,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:07,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:17:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817090320] [2025-03-17 15:17:07,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:07,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:07,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:07,844 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:17:07,845 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:17:07,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:17:07,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:17:07,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:07,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:07,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:17:07,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:17:07,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:17:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:07,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040169557] [2025-03-17 15:17:07,940 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:17:07,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817090320] [2025-03-17 15:17:07,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817090320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:17:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101485929] [2025-03-17 15:17:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:07,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:17:07,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:07,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:17:07,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:17:07,942 INFO L87 Difference]: Start difference. First operand 186 states and 193 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:17:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:08,013 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2025-03-17 15:17:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:17:08,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-17 15:17:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:08,015 INFO L225 Difference]: With dead ends: 186 [2025-03-17 15:17:08,015 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 15:17:08,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:17:08,016 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 8 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:08,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 667 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:17:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 15:17:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-17 15:17:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 103 states have (on average 1.7184466019417475) internal successors, (177), 174 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 191 transitions. [2025-03-17 15:17:08,022 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 191 transitions. Word has length 18 [2025-03-17 15:17:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:08,022 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 191 transitions. [2025-03-17 15:17:08,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:17:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 191 transitions. [2025-03-17 15:17:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:17:08,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:08,023 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:08,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:17:08,223 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,SelfDestructingSolverStorable3 [2025-03-17 15:17:08,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:08,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 896922056, now seen corresponding path program 1 times [2025-03-17 15:17:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750214131] [2025-03-17 15:17:08,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:08,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:17:08,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:17:08,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:08,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:17:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978381315] [2025-03-17 15:17:08,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:08,245 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:17:08,246 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:17:08,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:17:08,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:17:08,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:08,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:08,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:17:08,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:17:08,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:17:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750214131] [2025-03-17 15:17:08,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:17:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978381315] [2025-03-17 15:17:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978381315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:17:08,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:17:08,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-17 15:17:08,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440204037] [2025-03-17 15:17:08,426 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:17:08,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:17:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:08,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:17:08,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:17:08,427 INFO L87 Difference]: Start difference. First operand 184 states and 191 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:17:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:08,507 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2025-03-17 15:17:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:17:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-03-17 15:17:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:08,509 INFO L225 Difference]: With dead ends: 184 [2025-03-17 15:17:08,509 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 15:17:08,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:17:08,510 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 141 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:08,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 463 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:17:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 15:17:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-17 15:17:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 103 states have (on average 1.6893203883495145) internal successors, (174), 171 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 188 transitions. [2025-03-17 15:17:08,516 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 188 transitions. Word has length 35 [2025-03-17 15:17:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 188 transitions. [2025-03-17 15:17:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:17:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 188 transitions. [2025-03-17 15:17:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:17:08,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:08,517 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:08,523 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:17:08,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:08,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:08,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2034780100, now seen corresponding path program 1 times [2025-03-17 15:17:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085799148] [2025-03-17 15:17:08,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:08,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:17:08,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:17:08,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:08,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:17:08,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:08,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085799148] [2025-03-17 15:17:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085799148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:17:08,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290732634] [2025-03-17 15:17:08,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:08,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:08,882 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:17:08,884 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:17:08,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:17:08,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:17:08,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:08,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:08,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:17:08,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:17:08,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:17:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290732634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:08,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:17:08,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 15:17:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761167744] [2025-03-17 15:17:08,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:08,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:17:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:08,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:17:08,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:17:08,988 INFO L87 Difference]: Start difference. First operand 181 states and 188 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:09,091 INFO L93 Difference]: Finished difference Result 181 states and 188 transitions. [2025-03-17 15:17:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:17:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-03-17 15:17:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:09,092 INFO L225 Difference]: With dead ends: 181 [2025-03-17 15:17:09,092 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 15:17:09,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:17:09,093 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 140 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:09,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 595 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:17:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 15:17:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-17 15:17:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 170 states have internal predecessors, (173), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2025-03-17 15:17:09,099 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 36 [2025-03-17 15:17:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:09,099 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2025-03-17 15:17:09,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2025-03-17 15:17:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 15:17:09,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:09,100 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:17:09,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:09,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:09,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1346326203, now seen corresponding path program 1 times [2025-03-17 15:17:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:09,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061077514] [2025-03-17 15:17:09,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:09,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:09,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:17:09,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:17:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:17:09,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:09,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061077514] [2025-03-17 15:17:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061077514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:09,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:09,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:17:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186948675] [2025-03-17 15:17:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:09,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:17:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:09,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:17:09,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:09,362 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:09,418 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2025-03-17 15:17:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:17:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-03-17 15:17:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:09,419 INFO L225 Difference]: With dead ends: 184 [2025-03-17 15:17:09,420 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 15:17:09,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:09,421 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 97 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:09,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 214 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:17:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 15:17:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-17 15:17:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 171 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 188 transitions. [2025-03-17 15:17:09,433 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 188 transitions. Word has length 37 [2025-03-17 15:17:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:09,434 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 188 transitions. [2025-03-17 15:17:09,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 188 transitions. [2025-03-17 15:17:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 15:17:09,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:09,434 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:09,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:17:09,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:09,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1213560802, now seen corresponding path program 1 times [2025-03-17 15:17:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169750387] [2025-03-17 15:17:09,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:09,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 15:17:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:17:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:17:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169750387] [2025-03-17 15:17:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169750387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:09,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:17:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289046393] [2025-03-17 15:17:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:17:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:09,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:17:09,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:17:09,481 INFO L87 Difference]: Start difference. First operand 181 states and 188 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:09,575 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2025-03-17 15:17:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:17:09,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-17 15:17:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:09,576 INFO L225 Difference]: With dead ends: 185 [2025-03-17 15:17:09,576 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:17:09,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:17:09,577 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 107 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:09,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 324 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:17:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:17:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-17 15:17:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 107 states have (on average 1.6355140186915889) internal successors, (175), 172 states have internal predecessors, (175), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:17:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions. [2025-03-17 15:17:09,584 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 38 [2025-03-17 15:17:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:09,584 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions. [2025-03-17 15:17:09,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions. [2025-03-17 15:17:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 15:17:09,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:09,585 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:09,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:17:09,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1034320669, now seen corresponding path program 1 times [2025-03-17 15:17:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370127502] [2025-03-17 15:17:09,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:09,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:17:09,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:17:09,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:09,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:17:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743644913] [2025-03-17 15:17:09,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:09,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:09,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:09,599 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:17:09,601 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:17:09,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:17:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:17:09,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:09,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:09,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 15:17:09,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:17:09,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:17:09,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370127502] [2025-03-17 15:17:09,660 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:17:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743644913] [2025-03-17 15:17:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743644913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:09,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:09,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:17:09,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875598894] [2025-03-17 15:17:09,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:09,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:17:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:09,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:17:09,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:09,661 INFO L87 Difference]: Start difference. First operand 182 states and 189 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:09,749 INFO L93 Difference]: Finished difference Result 285 states and 305 transitions. [2025-03-17 15:17:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:17:09,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2025-03-17 15:17:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:09,750 INFO L225 Difference]: With dead ends: 285 [2025-03-17 15:17:09,750 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 15:17:09,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:09,751 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 95 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:09,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 300 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:17:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 15:17:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 242. [2025-03-17 15:17:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 164 states have (on average 1.670731707317073) internal successors, (274), 229 states have internal predecessors, (274), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:17:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 294 transitions. [2025-03-17 15:17:09,761 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 294 transitions. Word has length 39 [2025-03-17 15:17:09,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:09,761 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 294 transitions. [2025-03-17 15:17:09,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:09,761 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 294 transitions. [2025-03-17 15:17:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 15:17:09,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:09,761 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:09,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:17:09,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:09,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:09,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1999169536, now seen corresponding path program 1 times [2025-03-17 15:17:09,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:09,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306789968] [2025-03-17 15:17:09,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:09,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:17:09,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:17:09,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:09,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:17:10,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:10,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306789968] [2025-03-17 15:17:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306789968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:17:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387533052] [2025-03-17 15:17:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:10,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:17:10,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:17:10,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:17:10,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:17:10,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:10,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:10,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:17:10,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:17:10,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:17:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387533052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:17:10,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:17:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-17 15:17:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895534862] [2025-03-17 15:17:10,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:17:10,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:17:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:10,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:17:10,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:17:10,517 INFO L87 Difference]: Start difference. First operand 242 states and 294 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:17:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:10,876 INFO L93 Difference]: Finished difference Result 381 states and 412 transitions. [2025-03-17 15:17:10,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:17:10,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 40 [2025-03-17 15:17:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:10,878 INFO L225 Difference]: With dead ends: 381 [2025-03-17 15:17:10,878 INFO L226 Difference]: Without dead ends: 378 [2025-03-17 15:17:10,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:17:10,879 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 607 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:10,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 959 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:17:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-17 15:17:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 284. [2025-03-17 15:17:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 204 states have (on average 1.6666666666666667) internal successors, (340), 269 states have internal predecessors, (340), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:17:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 364 transitions. [2025-03-17 15:17:10,893 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 364 transitions. Word has length 40 [2025-03-17 15:17:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:10,893 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 364 transitions. [2025-03-17 15:17:10,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:17:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2025-03-17 15:17:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:17:10,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:10,894 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:10,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:17:11,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:11,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1351538658, now seen corresponding path program 1 times [2025-03-17 15:17:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78772477] [2025-03-17 15:17:11,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:17:11,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:17:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:17:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618471511] [2025-03-17 15:17:11,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:11,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:11,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:11,106 INFO L229 MonitoredProcess]: Starting monitored process 8 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:17:11,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:17:11,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:17:11,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:17:11,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:11,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:11,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:17:11,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:17:11,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:17:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:17:11,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:11,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78772477] [2025-03-17 15:17:11,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:17:11,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618471511] [2025-03-17 15:17:11,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618471511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:17:11,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:17:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 15:17:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350257692] [2025-03-17 15:17:11,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:17:11,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:17:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:11,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:17:11,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:17:11,409 INFO L87 Difference]: Start difference. First operand 284 states and 364 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:17:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:12,076 INFO L93 Difference]: Finished difference Result 413 states and 531 transitions. [2025-03-17 15:17:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:17:12,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2025-03-17 15:17:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:12,078 INFO L225 Difference]: With dead ends: 413 [2025-03-17 15:17:12,078 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 15:17:12,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:17:12,079 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 305 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:12,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 492 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:17:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 15:17:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 360. [2025-03-17 15:17:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 294 states have (on average 1.4625850340136055) internal successors, (430), 342 states have internal predecessors, (430), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:17:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 460 transitions. [2025-03-17 15:17:12,097 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 460 transitions. Word has length 42 [2025-03-17 15:17:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:12,097 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 460 transitions. [2025-03-17 15:17:12,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:17:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 460 transitions. [2025-03-17 15:17:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:17:12,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:12,098 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:12,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:17:12,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:12,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:12,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1748522948, now seen corresponding path program 1 times [2025-03-17 15:17:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:12,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789722495] [2025-03-17 15:17:12,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:12,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:17:12,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:17:12,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:12,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:17:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391788713] [2025-03-17 15:17:12,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:12,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:12,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:12,312 INFO L229 MonitoredProcess]: Starting monitored process 9 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:17:12,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:17:12,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:17:12,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:17:12,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:12,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:12,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:17:12,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:17:12,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:17:12,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:12,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789722495] [2025-03-17 15:17:12,358 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:17:12,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391788713] [2025-03-17 15:17:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391788713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:12,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:17:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338990121] [2025-03-17 15:17:12,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:12,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:17:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:12,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:17:12,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:12,360 INFO L87 Difference]: Start difference. First operand 360 states and 460 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:12,527 INFO L93 Difference]: Finished difference Result 554 states and 707 transitions. [2025-03-17 15:17:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:17:12,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-03-17 15:17:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:12,529 INFO L225 Difference]: With dead ends: 554 [2025-03-17 15:17:12,529 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 15:17:12,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:17:12,530 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 86 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:12,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 202 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:17:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 15:17:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2025-03-17 15:17:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 430 states have (on average 1.3651162790697675) internal successors, (587), 478 states have internal predecessors, (587), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:17:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 627 transitions. [2025-03-17 15:17:12,554 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 627 transitions. Word has length 44 [2025-03-17 15:17:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:12,554 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 627 transitions. [2025-03-17 15:17:12,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:17:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 627 transitions. [2025-03-17 15:17:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:17:12,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:12,556 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:12,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 15:17:12,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 15:17:12,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:12,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1388830020, now seen corresponding path program 1 times [2025-03-17 15:17:12,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:12,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261380505] [2025-03-17 15:17:12,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:12,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:17:12,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:17:12,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:12,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:17:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261380505] [2025-03-17 15:17:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261380505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:12,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:12,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:17:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960279567] [2025-03-17 15:17:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:12,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:17:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:12,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:17:12,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:17:12,820 INFO L87 Difference]: Start difference. First operand 501 states and 627 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:17:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:13,041 INFO L93 Difference]: Finished difference Result 514 states and 628 transitions. [2025-03-17 15:17:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:17:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2025-03-17 15:17:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:13,043 INFO L225 Difference]: With dead ends: 514 [2025-03-17 15:17:13,043 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 15:17:13,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:17:13,044 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 55 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:13,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 275 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:17:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 15:17:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2025-03-17 15:17:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 430 states have (on average 1.3604651162790697) internal successors, (585), 478 states have internal predecessors, (585), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:17:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 625 transitions. [2025-03-17 15:17:13,066 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 625 transitions. Word has length 85 [2025-03-17 15:17:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 625 transitions. [2025-03-17 15:17:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:17:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 625 transitions. [2025-03-17 15:17:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 15:17:13,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:13,068 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:17:13,068 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -104057604, now seen corresponding path program 1 times [2025-03-17 15:17:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531548912] [2025-03-17 15:17:13,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:13,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 15:17:13,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 15:17:13,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:13,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:17:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531548912] [2025-03-17 15:17:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531548912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:17:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:17:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:17:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841501101] [2025-03-17 15:17:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:17:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:17:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:13,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:17:13,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:17:13,153 INFO L87 Difference]: Start difference. First operand 501 states and 625 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:17:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:13,428 INFO L93 Difference]: Finished difference Result 510 states and 630 transitions. [2025-03-17 15:17:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:17:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2025-03-17 15:17:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:13,431 INFO L225 Difference]: With dead ends: 510 [2025-03-17 15:17:13,431 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 15:17:13,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:17:13,432 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 244 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:13,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 197 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:17:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 15:17:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 501. [2025-03-17 15:17:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 430 states have (on average 1.3558139534883722) internal successors, (583), 478 states have internal predecessors, (583), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:17:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 623 transitions. [2025-03-17 15:17:13,450 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 623 transitions. Word has length 86 [2025-03-17 15:17:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:13,450 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 623 transitions. [2025-03-17 15:17:13,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:17:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 623 transitions. [2025-03-17 15:17:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 15:17:13,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:13,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:13,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:17:13,451 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 986360551, now seen corresponding path program 1 times [2025-03-17 15:17:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423656041] [2025-03-17 15:17:13,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:13,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 15:17:13,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:17:13,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:13,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:17:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423656041] [2025-03-17 15:17:13,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423656041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:17:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694437087] [2025-03-17 15:17:13,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:13,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:13,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:13,565 INFO L229 MonitoredProcess]: Starting monitored process 10 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:17:13,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:17:13,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 15:17:13,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:17:13,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:13,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:13,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:17:13,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:17:13,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:17:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:17:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694437087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:17:13,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:17:13,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-17 15:17:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828149983] [2025-03-17 15:17:13,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:17:13,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:17:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:13,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:17:13,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:17:13,872 INFO L87 Difference]: Start difference. First operand 501 states and 623 transitions. Second operand has 14 states, 13 states have (on average 13.23076923076923) internal successors, (172), 14 states have internal predecessors, (172), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-17 15:17:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:17:14,580 INFO L93 Difference]: Finished difference Result 1088 states and 1354 transitions. [2025-03-17 15:17:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:17:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.23076923076923) internal successors, (172), 14 states have internal predecessors, (172), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 89 [2025-03-17 15:17:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:17:14,583 INFO L225 Difference]: With dead ends: 1088 [2025-03-17 15:17:14,583 INFO L226 Difference]: Without dead ends: 611 [2025-03-17 15:17:14,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:17:14,585 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1112 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:17:14,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 387 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:17:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-17 15:17:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 575. [2025-03-17 15:17:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 502 states have (on average 1.3346613545816732) internal successors, (670), 548 states have internal predecessors, (670), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 15:17:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 718 transitions. [2025-03-17 15:17:14,609 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 718 transitions. Word has length 89 [2025-03-17 15:17:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:17:14,609 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 718 transitions. [2025-03-17 15:17:14,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.23076923076923) internal successors, (172), 14 states have internal predecessors, (172), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-17 15:17:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 718 transitions. [2025-03-17 15:17:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 15:17:14,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:17:14,611 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:17:14,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:17:14,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:17:14,816 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-03-17 15:17:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:17:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash 512406104, now seen corresponding path program 1 times [2025-03-17 15:17:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:17:14,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440288985] [2025-03-17 15:17:14,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:14,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:17:14,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:17:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:17:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:17:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:17:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440288985] [2025-03-17 15:17:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440288985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:17:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513926912] [2025-03-17 15:17:14,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:17:14,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:17:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:17:14,896 INFO L229 MonitoredProcess]: Starting monitored process 11 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:17:14,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 15:17:14,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:17:14,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:17:14,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:17:14,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:17:14,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:17:14,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:17:29,977 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_45| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_45| |v_ULTIMATE.start_main_~R~0#1_45|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2025-03-17 15:17:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 2 not checked. [2025-03-17 15:17:29,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:17:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:17:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513926912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:17:31,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:17:31,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 15:17:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776100684] [2025-03-17 15:17:31,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:17:31,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:17:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:17:31,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:17:31,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=105, Unknown=7, NotChecked=22, Total=182 [2025-03-17 15:17:31,192 INFO L87 Difference]: Start difference. First operand 575 states and 718 transitions. Second operand has 14 states, 13 states have (on average 12.615384615384615) internal successors, (164), 14 states have internal predecessors, (164), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 15:17:47,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:17:51,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:17:59,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:07,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:11,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:16,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:20,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:24,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:28,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:32,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:37,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:41,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:45,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:18:49,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]