./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.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 3d5962362825282ae42e15c2becb997ecc48fe70f2dab3f327a660cebbeb623f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:03:14,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:03:14,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:03:14,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:03:14,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:03:14,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:03:14,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:03:14,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:03:14,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:03:14,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:03:14,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:03:14,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:03:14,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:03:14,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:03:14,952 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:03:14,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:03:14,953 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:03:14,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:03:14,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:03:14,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:03:14,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:03:14,955 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 -> 3d5962362825282ae42e15c2becb997ecc48fe70f2dab3f327a660cebbeb623f [2025-03-04 11:03:15,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:03:15,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:03:15,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:03:15,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:03:15,182 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:03:15,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c [2025-03-04 11:03:16,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a387ddf6/de1a82de881a410791e0d16541f6205a/FLAG08d210d89 [2025-03-04 11:03:16,527 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:03:16,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c [2025-03-04 11:03:16,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a387ddf6/de1a82de881a410791e0d16541f6205a/FLAG08d210d89 [2025-03-04 11:03:16,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a387ddf6/de1a82de881a410791e0d16541f6205a [2025-03-04 11:03:16,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:03:16,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:03:16,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:03:16,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:03:16,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:03:16,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:03:16" (1/1) ... [2025-03-04 11:03:16,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcc581a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:16, skipping insertion in model container [2025-03-04 11:03:16,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:03:16" (1/1) ... [2025-03-04 11:03:16,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:03:16,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:03:16,980 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:03:16,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:03:17,004 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:03:17,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17 WrapperNode [2025-03-04 11:03:17,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:03:17,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:03:17,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:03:17,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:03:17,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,026 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2025-03-04 11:03:17,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:03:17,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:03:17,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:03:17,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:03:17,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,040 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:03:17,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:03:17,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:03:17,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:03:17,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:03:17,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (1/1) ... [2025-03-04 11:03:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:03:17,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:17,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:03:17,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:03:17,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:03:17,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:03:17,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:03:17,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:03:17,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:03:17,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:03:17,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:03:17,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:03:17,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:03:17,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:03:17,459 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-04 11:03:17,459 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:03:17,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:03:17,470 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:03:17,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:03:17 BoogieIcfgContainer [2025-03-04 11:03:17,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:03:17,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:03:17,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:03:17,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:03:17,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:03:16" (1/3) ... [2025-03-04 11:03:17,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0573a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:03:17, skipping insertion in model container [2025-03-04 11:03:17,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:03:17" (2/3) ... [2025-03-04 11:03:17,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0573a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:03:17, skipping insertion in model container [2025-03-04 11:03:17,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:03:17" (3/3) ... [2025-03-04 11:03:17,477 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound1.c [2025-03-04 11:03:17,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:03:17,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat2-ll_valuebound1.c that has 3 procedures, 137 locations, 1 initial locations, 1 loop locations, and 56 error locations. [2025-03-04 11:03:17,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:03:17,527 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;@5d4d58d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:03:17,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-04 11:03:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 128 states have internal predecessors, (133), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:03:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:03:17,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:17,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:03:17,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:17,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 384270576, now seen corresponding path program 1 times [2025-03-04 11:03:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142258193] [2025-03-04 11:03:17,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:17,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:17,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:03:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:03:17,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:17,620 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-04 11:03:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142258193] [2025-03-04 11:03:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142258193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749846126] [2025-03-04 11:03:17,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:17,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:17,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:17,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:17,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:03:17,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:03:17,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:03:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:17,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:03:17,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:17,670 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-04 11:03:17,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:03:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749846126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:17,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:03:17,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:03:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849748836] [2025-03-04 11:03:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:17,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:03:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:17,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:03:17,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:03:17,695 INFO L87 Difference]: Start difference. First operand has 137 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 128 states have internal predecessors, (133), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:03:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:17,712 INFO L93 Difference]: Finished difference Result 264 states and 291 transitions. [2025-03-04 11:03:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:03:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 11:03:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:17,718 INFO L225 Difference]: With dead ends: 264 [2025-03-04 11:03:17,718 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 11:03:17,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:03:17,722 INFO L435 NwaCegarLoop]: 135 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, 135 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-04 11:03:17,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:03:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 11:03:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-04 11:03:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 116 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2025-03-04 11:03:17,748 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 14 [2025-03-04 11:03:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:17,748 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2025-03-04 11:03:17,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:03:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2025-03-04 11:03:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:03:17,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:17,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:03:17,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:03:17,953 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-04 11:03:17,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash 187786862, now seen corresponding path program 1 times [2025-03-04 11:03:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870210252] [2025-03-04 11:03:17,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:17,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:03:17,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:03:17,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:17,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:18,007 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-04 11:03:18,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870210252] [2025-03-04 11:03:18,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870210252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:18,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:18,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:03:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991280930] [2025-03-04 11:03:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:18,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:03:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:18,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:03:18,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:03:18,009 INFO L87 Difference]: Start difference. First operand 124 states and 128 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-04 11:03:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:18,058 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2025-03-04 11:03:18,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:03:18,058 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-04 11:03:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:18,059 INFO L225 Difference]: With dead ends: 124 [2025-03-04 11:03:18,059 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 11:03:18,059 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-04 11:03:18,060 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 199 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-04 11:03:18,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 199 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:03:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 11:03:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 11:03:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 112 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2025-03-04 11:03:18,066 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 14 [2025-03-04 11:03:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:18,067 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2025-03-04 11:03:18,067 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-04 11:03:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2025-03-04 11:03:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:03:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:18,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:03:18,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:03:18,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:18,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1526425516, now seen corresponding path program 1 times [2025-03-04 11:03:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:18,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736854982] [2025-03-04 11:03:18,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:18,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:03:18,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:03:18,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:18,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:18,108 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-04 11:03:18,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:18,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736854982] [2025-03-04 11:03:18,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736854982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:18,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:03:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818969294] [2025-03-04 11:03:18,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:18,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:03:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:18,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:03:18,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:03:18,109 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:03:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:18,139 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2025-03-04 11:03:18,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:03:18,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 15 [2025-03-04 11:03:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:18,140 INFO L225 Difference]: With dead ends: 120 [2025-03-04 11:03:18,140 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 11:03:18,140 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-04 11:03:18,141 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 199 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-04 11:03:18,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 199 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:03:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 11:03:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 11:03:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 108 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2025-03-04 11:03:18,147 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 15 [2025-03-04 11:03:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:18,147 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2025-03-04 11:03:18,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:03:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2025-03-04 11:03:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:03:18,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:18,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:03:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:03:18,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:18,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 445710248, now seen corresponding path program 1 times [2025-03-04 11:03:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160969947] [2025-03-04 11:03:18,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:18,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:03:18,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:03:18,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:18,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:03:18,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946055701] [2025-03-04 11:03:18,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:18,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:18,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:18,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:18,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:03:18,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:03:18,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:03:18,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:18,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:18,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:03:18,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:18,252 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-04 11:03:18,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:03:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160969947] [2025-03-04 11:03:18,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:03:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946055701] [2025-03-04 11:03:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946055701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:03:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684412578] [2025-03-04 11:03:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:18,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:03:18,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:18,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:03:18,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:03:18,255 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-04 11:03:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:18,329 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2025-03-04 11:03:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:03:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2025-03-04 11:03:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:18,330 INFO L225 Difference]: With dead ends: 116 [2025-03-04 11:03:18,330 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 11:03:18,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-04 11:03:18,331 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 8 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 375 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-04 11:03:18,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 375 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 11:03:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 11:03:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2025-03-04 11:03:18,340 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 19 [2025-03-04 11:03:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:18,341 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2025-03-04 11:03:18,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-04 11:03:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2025-03-04 11:03:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:03:18,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:18,341 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-04 11:03:18,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:18,542 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-04 11:03:18,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2128704892, now seen corresponding path program 1 times [2025-03-04 11:03:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965829788] [2025-03-04 11:03:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:18,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:03:18,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:03:18,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:18,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:03:18,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60747675] [2025-03-04 11:03:18,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:18,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:18,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:18,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:18,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:03:18,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:03:18,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:03:18,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:18,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:18,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:03:18,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:18,708 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-04 11:03:18,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965829788] [2025-03-04 11:03:18,764 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:03:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60747675] [2025-03-04 11:03:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60747675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:18,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:03:18,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 11:03:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432270815] [2025-03-04 11:03:18,767 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:18,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:03:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:18,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:03:18,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:03:18,770 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-04 11:03:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:18,826 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2025-03-04 11:03:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:03:18,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 36 [2025-03-04 11:03:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:18,827 INFO L225 Difference]: With dead ends: 114 [2025-03-04 11:03:18,827 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:03:18,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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-04 11:03:18,827 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 79 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 291 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:18,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 291 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:03:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:03:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 11:03:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 103 states have internal predecessors, (105), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2025-03-04 11:03:18,838 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 36 [2025-03-04 11:03:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:18,838 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2025-03-04 11:03:18,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-04 11:03:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2025-03-04 11:03:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:03:18,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:18,839 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-04 11:03:18,845 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-04 11:03:19,040 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-04 11:03:19,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1565342148, now seen corresponding path program 1 times [2025-03-04 11:03:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909978654] [2025-03-04 11:03:19,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:19,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:19,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:03:19,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:03:19,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:19,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:19,211 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-04 11:03:19,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909978654] [2025-03-04 11:03:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909978654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028771987] [2025-03-04 11:03:19,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:19,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:19,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:03:19,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:03:19,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:03:19,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:19,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:19,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:03:19,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:19,351 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-04 11:03:19,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:03:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028771987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:19,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:03:19,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 11:03:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505901445] [2025-03-04 11:03:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:19,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:03:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:19,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:03:19,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:03:19,352 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-04 11:03:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:19,432 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2025-03-04 11:03:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:03:19,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 37 [2025-03-04 11:03:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:19,433 INFO L225 Difference]: With dead ends: 111 [2025-03-04 11:03:19,433 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 11:03:19,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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-04 11:03:19,435 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 78 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:19,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 380 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 11:03:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 11:03:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 102 states have internal predecessors, (104), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-04 11:03:19,443 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 37 [2025-03-04 11:03:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:19,443 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-04 11:03:19,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-04 11:03:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-04 11:03:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 11:03:19,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:19,444 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-04 11:03:19,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:19,644 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-04 11:03:19,645 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:19,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1280966271, now seen corresponding path program 1 times [2025-03-04 11:03:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:19,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130685563] [2025-03-04 11:03:19,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:19,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:03:19,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:03:19,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:19,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:19,684 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-04 11:03:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130685563] [2025-03-04 11:03:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130685563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:03:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296889282] [2025-03-04 11:03:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:19,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:03:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:19,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:03:19,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:03:19,686 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-04 11:03:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:19,720 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2025-03-04 11:03:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:03:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-04 11:03:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:19,722 INFO L225 Difference]: With dead ends: 112 [2025-03-04 11:03:19,722 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:03:19,722 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-04 11:03:19,723 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:19,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 157 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:03:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:03:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 11:03:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 103 states have internal predecessors, (105), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2025-03-04 11:03:19,730 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 38 [2025-03-04 11:03:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:19,730 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2025-03-04 11:03:19,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-04 11:03:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2025-03-04 11:03:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 11:03:19,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:19,731 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-04 11:03:19,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:03:19,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:19,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1055248678, now seen corresponding path program 1 times [2025-03-04 11:03:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:19,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112670888] [2025-03-04 11:03:19,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:19,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:19,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:03:19,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:03:19,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:19,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:19,775 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-04 11:03:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:19,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112670888] [2025-03-04 11:03:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112670888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:19,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:19,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:03:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430855280] [2025-03-04 11:03:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:19,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:03:19,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:19,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:03:19,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:03:19,777 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-04 11:03:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:19,835 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2025-03-04 11:03:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:03:19,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-04 11:03:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:19,836 INFO L225 Difference]: With dead ends: 113 [2025-03-04 11:03:19,836 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 11:03:19,836 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-04 11:03:19,837 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:19,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 209 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 11:03:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 11:03:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.536231884057971) internal successors, (106), 104 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2025-03-04 11:03:19,845 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 39 [2025-03-04 11:03:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:19,845 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2025-03-04 11:03:19,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-04 11:03:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2025-03-04 11:03:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:03:19,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:19,852 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-04 11:03:19,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:03:19,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:19,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1647029407, now seen corresponding path program 1 times [2025-03-04 11:03:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527690531] [2025-03-04 11:03:19,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:19,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:03:19,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:03:19,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:19,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:03:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713253558] [2025-03-04 11:03:19,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:19,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:19,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:03:19,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:03:19,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:03:19,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:19,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:19,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:03:19,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:19,920 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-04 11:03:19,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:03:19,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:19,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527690531] [2025-03-04 11:03:19,921 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:03:19,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713253558] [2025-03-04 11:03:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713253558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:19,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:19,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:03:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805486365] [2025-03-04 11:03:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:19,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:03:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:19,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:03:19,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:03:19,922 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-04 11:03:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:19,969 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2025-03-04 11:03:19,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:03:19,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 40 [2025-03-04 11:03:19,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:19,970 INFO L225 Difference]: With dead ends: 148 [2025-03-04 11:03:19,970 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 11:03:19,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-04 11:03:19,971 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 33 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:19,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 186 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:03:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 11:03:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 113. [2025-03-04 11:03:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 105 states have internal predecessors, (107), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:03:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2025-03-04 11:03:19,976 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 40 [2025-03-04 11:03:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:19,977 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2025-03-04 11:03:19,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-04 11:03:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2025-03-04 11:03:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 11:03:19,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:19,978 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] [2025-03-04 11:03:19,984 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-04 11:03:20,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:20,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -481695880, now seen corresponding path program 1 times [2025-03-04 11:03:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598368830] [2025-03-04 11:03:20,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:20,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 11:03:20,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 11:03:20,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:20,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:20,358 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-04 11:03:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598368830] [2025-03-04 11:03:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598368830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762964475] [2025-03-04 11:03:20,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:20,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:20,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:20,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:20,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:03:20,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 11:03:20,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 11:03:20,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:20,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:20,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:03:20,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:20,559 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-04 11:03:20,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762964475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:20,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:03:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-04 11:03:20,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937711144] [2025-03-04 11:03:20,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:20,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:03:20,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:20,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:03:20,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:03:20,767 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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-04 11:03:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:21,063 INFO L93 Difference]: Finished difference Result 232 states and 243 transitions. [2025-03-04 11:03:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:03:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 41 [2025-03-04 11:03:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:21,064 INFO L225 Difference]: With dead ends: 232 [2025-03-04 11:03:21,064 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 11:03:21,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:03:21,064 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:21,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 602 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:03:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 11:03:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2025-03-04 11:03:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 122 states have internal predecessors, (137), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:03:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2025-03-04 11:03:21,070 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 41 [2025-03-04 11:03:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2025-03-04 11:03:21,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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-04 11:03:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2025-03-04 11:03:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:03:21,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:21,071 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] [2025-03-04 11:03:21,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:21,272 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-04 11:03:21,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 946728982, now seen corresponding path program 1 times [2025-03-04 11:03:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796154462] [2025-03-04 11:03:21,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:21,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:03:21,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:03:21,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:21,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:03:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403129683] [2025-03-04 11:03:21,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:21,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:21,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:21,295 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-04 11:03:21,297 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-04 11:03:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:03:21,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:03:21,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:21,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:21,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:03:21,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:21,482 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-04 11:03:21,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:03:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796154462] [2025-03-04 11:03:21,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:03:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403129683] [2025-03-04 11:03:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403129683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:03:21,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:03:21,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-04 11:03:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298715581] [2025-03-04 11:03:21,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:21,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:03:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:21,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:03:21,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:03:21,656 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:03:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:22,058 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2025-03-04 11:03:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:03:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2025-03-04 11:03:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:22,060 INFO L225 Difference]: With dead ends: 172 [2025-03-04 11:03:22,061 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 11:03:22,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:03:22,062 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 273 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:22,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 214 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:03:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 11:03:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2025-03-04 11:03:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 138 states have internal predecessors, (158), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:03:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2025-03-04 11:03:22,071 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 43 [2025-03-04 11:03:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:22,072 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2025-03-04 11:03:22,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:03:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2025-03-04 11:03:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:03:22,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:22,074 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, 1] [2025-03-04 11:03:22,080 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-04 11:03:22,275 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-04 11:03:22,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash -726513484, now seen corresponding path program 1 times [2025-03-04 11:03:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290326427] [2025-03-04 11:03:22,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:22,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:03:22,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:03:22,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:03:22,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828047588] [2025-03-04 11:03:22,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:22,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:22,287 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-04 11:03:22,288 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-04 11:03:22,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:03:22,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:03:22,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:22,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:22,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:03:22,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:22,335 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-04 11:03:22,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:03:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:22,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290326427] [2025-03-04 11:03:22,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:03:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828047588] [2025-03-04 11:03:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828047588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:22,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:22,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:03:22,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359688699] [2025-03-04 11:03:22,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:22,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:03:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:22,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:03:22,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:03:22,337 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-04 11:03:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:22,423 INFO L93 Difference]: Finished difference Result 219 states and 254 transitions. [2025-03-04 11:03:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:03:22,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 45 [2025-03-04 11:03:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:22,424 INFO L225 Difference]: With dead ends: 219 [2025-03-04 11:03:22,425 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 11:03:22,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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-04 11:03:22,425 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:22,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 132 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 11:03:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2025-03-04 11:03:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 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-04 11:03:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 212 transitions. [2025-03-04 11:03:22,434 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 212 transitions. Word has length 45 [2025-03-04 11:03:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:22,434 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 212 transitions. [2025-03-04 11:03:22,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-04 11:03:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 212 transitions. [2025-03-04 11:03:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 11:03:22,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:22,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:03:22,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:22,641 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-04 11:03:22,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1425814989, now seen corresponding path program 1 times [2025-03-04 11:03:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:22,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229473872] [2025-03-04 11:03:22,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:22,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:03:22,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:03:22,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:22,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:22,718 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-04 11:03:22,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:22,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229473872] [2025-03-04 11:03:22,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229473872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:22,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:22,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:03:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829069686] [2025-03-04 11:03:22,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:22,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:03:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:22,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:03:22,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:03:22,720 INFO L87 Difference]: Start difference. First operand 182 states and 212 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:22,830 INFO L93 Difference]: Finished difference Result 182 states and 212 transitions. [2025-03-04 11:03:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:03:22,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-03-04 11:03:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:22,832 INFO L225 Difference]: With dead ends: 182 [2025-03-04 11:03:22,832 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 11:03:22,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:03:22,833 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 100 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:22,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 175 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 11:03:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-04 11:03:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 171 states have internal predecessors, (195), 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-04 11:03:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2025-03-04 11:03:22,841 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 63 [2025-03-04 11:03:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:22,841 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2025-03-04 11:03:22,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2025-03-04 11:03:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 11:03:22,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:22,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:03:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:03:22,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:22,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1250591717, now seen corresponding path program 1 times [2025-03-04 11:03:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:22,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264556101] [2025-03-04 11:03:22,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:22,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 11:03:22,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:03:22,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:22,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:22,889 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-04 11:03:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264556101] [2025-03-04 11:03:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264556101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:03:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045835838] [2025-03-04 11:03:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:22,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:03:22,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:22,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:03:22,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:03:22,891 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:22,992 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2025-03-04 11:03:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:03:22,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-03-04 11:03:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:22,993 INFO L225 Difference]: With dead ends: 185 [2025-03-04 11:03:22,993 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 11:03:22,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:03:22,994 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 49 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:22,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 167 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 11:03:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2025-03-04 11:03:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 170 states have internal predecessors, (192), 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-04 11:03:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2025-03-04 11:03:23,005 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 64 [2025-03-04 11:03:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:23,005 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2025-03-04 11:03:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2025-03-04 11:03:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:03:23,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:23,006 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, 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-04 11:03:23,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:03:23,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:23,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1831531514, now seen corresponding path program 1 times [2025-03-04 11:03:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98427133] [2025-03-04 11:03:23,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:23,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:23,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:03:23,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:03:23,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:23,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:03:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98427133] [2025-03-04 11:03:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98427133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:23,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:03:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271818657] [2025-03-04 11:03:23,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:23,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:03:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:23,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:03:23,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:03:23,069 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:23,168 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2025-03-04 11:03:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:03:23,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2025-03-04 11:03:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:23,170 INFO L225 Difference]: With dead ends: 181 [2025-03-04 11:03:23,170 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 11:03:23,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:03:23,171 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:23,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 222 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 11:03:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 11:03:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 170 states have internal predecessors, (189), 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-04 11:03:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2025-03-04 11:03:23,180 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 67 [2025-03-04 11:03:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:23,181 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2025-03-04 11:03:23,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2025-03-04 11:03:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:03:23,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:23,181 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 11:03:23,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:03:23,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:23,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 942902145, now seen corresponding path program 1 times [2025-03-04 11:03:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829370948] [2025-03-04 11:03:23,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:23,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:03:23,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:03:23,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:23,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:03:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829370948] [2025-03-04 11:03:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829370948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378163238] [2025-03-04 11:03:23,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:23,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:23,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:23,250 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-04 11:03:23,252 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-04 11:03:23,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:03:23,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:03:23,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:23,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:23,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:03:23,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:03:23,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:03:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378163238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:03:23,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:03:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-04 11:03:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203179731] [2025-03-04 11:03:23,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:03:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:23,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:03:23,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:03:23,552 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand has 15 states, 14 states have (on average 9.428571428571429) internal successors, (132), 15 states have internal predecessors, (132), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:03:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:23,897 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2025-03-04 11:03:23,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:03:23,898 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.428571428571429) internal successors, (132), 15 states have internal predecessors, (132), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 68 [2025-03-04 11:03:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:23,899 INFO L225 Difference]: With dead ends: 207 [2025-03-04 11:03:23,899 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:03:23,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:03:23,899 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 260 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:23,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 251 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:03:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:03:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 180. [2025-03-04 11:03:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.2534246575342465) internal successors, (183), 170 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-04 11:03:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2025-03-04 11:03:23,909 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 68 [2025-03-04 11:03:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:23,909 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2025-03-04 11:03:23,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.428571428571429) internal successors, (132), 15 states have internal predecessors, (132), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:03:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2025-03-04 11:03:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 11:03:23,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:23,910 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 11:03:23,916 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-04 11:03:24,111 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,SelfDestructingSolverStorable15 [2025-03-04 11:03:24,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:24,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -834804520, now seen corresponding path program 1 times [2025-03-04 11:03:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031542587] [2025-03-04 11:03:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:24,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:03:24,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:03:24,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:24,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 11:03:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031542587] [2025-03-04 11:03:24,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031542587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654959151] [2025-03-04 11:03:24,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:24,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:24,241 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-04 11:03:24,243 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-04 11:03:24,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:03:24,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:03:24,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:24,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:03:24,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 11:03:24,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 11:03:24,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654959151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:03:24,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:03:24,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-03-04 11:03:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224665022] [2025-03-04 11:03:24,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:24,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:03:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:24,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:03:24,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:03:24,490 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand has 15 states, 14 states have (on average 8.642857142857142) internal successors, (121), 15 states have internal predecessors, (121), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 11:03:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:24,784 INFO L93 Difference]: Finished difference Result 208 states and 229 transitions. [2025-03-04 11:03:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:03:24,784 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.642857142857142) internal successors, (121), 15 states have internal predecessors, (121), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 69 [2025-03-04 11:03:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:24,785 INFO L225 Difference]: With dead ends: 208 [2025-03-04 11:03:24,785 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 11:03:24,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:03:24,786 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 148 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:24,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 273 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:03:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 11:03:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 180. [2025-03-04 11:03:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 170 states have internal predecessors, (180), 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-04 11:03:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2025-03-04 11:03:24,796 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 69 [2025-03-04 11:03:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:24,796 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2025-03-04 11:03:24,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.642857142857142) internal successors, (121), 15 states have internal predecessors, (121), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 11:03:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2025-03-04 11:03:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:03:24,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:24,797 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:03:24,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:24,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:03:24,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:24,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1872638795, now seen corresponding path program 1 times [2025-03-04 11:03:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:24,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719462743] [2025-03-04 11:03:24,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:25,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:03:25,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:03:25,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:25,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 11:03:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719462743] [2025-03-04 11:03:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719462743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081881601] [2025-03-04 11:03:25,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:25,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:25,124 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:25,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:03:25,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:03:25,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:03:25,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:25,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:25,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:03:25,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 11:03:25,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081881601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:37,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:03:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-03-04 11:03:37,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495291431] [2025-03-04 11:03:37,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:37,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:03:37,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:37,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:03:37,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=115, Unknown=2, NotChecked=0, Total=156 [2025-03-04 11:03:37,925 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:03:39,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:03:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:39,871 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2025-03-04 11:03:39,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:03:39,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2025-03-04 11:03:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:39,872 INFO L225 Difference]: With dead ends: 180 [2025-03-04 11:03:39,872 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 11:03:39,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=57, Invalid=151, Unknown=2, NotChecked=0, Total=210 [2025-03-04 11:03:39,873 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 87 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:39,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 218 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 11:03:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 11:03:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-04 11:03:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 130 states have (on average 1.2) internal successors, (156), 150 states have internal predecessors, (156), 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-04 11:03:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2025-03-04 11:03:39,878 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 80 [2025-03-04 11:03:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:39,879 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2025-03-04 11:03:39,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:03:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2025-03-04 11:03:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 11:03:39,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:39,879 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:03:39,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:03:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:03:40,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:40,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash -398209715, now seen corresponding path program 1 times [2025-03-04 11:03:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:40,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480033174] [2025-03-04 11:03:40,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:40,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 11:03:40,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 11:03:40,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:40,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 11:03:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480033174] [2025-03-04 11:03:40,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480033174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:03:40,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:03:40,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:03:40,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168343919] [2025-03-04 11:03:40,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:03:40,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:03:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:40,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:03:40,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:03:40,123 INFO L87 Difference]: Start difference. First operand 160 states and 170 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:40,202 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2025-03-04 11:03:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:03:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2025-03-04 11:03:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:40,203 INFO L225 Difference]: With dead ends: 162 [2025-03-04 11:03:40,203 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 11:03:40,203 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-04 11:03:40,203 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:40,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 179 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:03:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 11:03:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-03-04 11:03:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 150 states have internal predecessors, (155), 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-04 11:03:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2025-03-04 11:03:40,209 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 92 [2025-03-04 11:03:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:40,209 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2025-03-04 11:03:40,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:03:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2025-03-04 11:03:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 11:03:40,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:40,210 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:03:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:03:40,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 540400733, now seen corresponding path program 1 times [2025-03-04 11:03:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002082155] [2025-03-04 11:03:40,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:40,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 11:03:40,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 11:03:40,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:40,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:03:40,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:40,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002082155] [2025-03-04 11:03:40,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002082155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:40,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316107006] [2025-03-04 11:03:40,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:40,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:40,267 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:40,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:03:40,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 11:03:40,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 11:03:40,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:40,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:40,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:03:40,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:03:40,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:03:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316107006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:03:40,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:03:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2025-03-04 11:03:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665675026] [2025-03-04 11:03:40,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:40,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:03:40,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:40,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:03:40,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:03:40,566 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 10 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-04 11:03:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:40,955 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2025-03-04 11:03:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:03:40,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 10 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) Word has length 93 [2025-03-04 11:03:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:40,957 INFO L225 Difference]: With dead ends: 161 [2025-03-04 11:03:40,957 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 11:03:40,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:03:40,958 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 206 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:40,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 154 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:03:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 11:03:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2025-03-04 11:03:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.1538461538461537) internal successors, (150), 146 states have internal predecessors, (150), 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-04 11:03:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2025-03-04 11:03:40,967 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 93 [2025-03-04 11:03:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:40,968 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2025-03-04 11:03:40,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 10 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-04 11:03:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2025-03-04 11:03:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 11:03:40,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:40,968 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:03:40,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:41,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:41,173 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:41,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:41,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1540819330, now seen corresponding path program 1 times [2025-03-04 11:03:41,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:41,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900725963] [2025-03-04 11:03:41,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:41,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:41,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:03:41,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:03:41,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:41,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 11:03:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900725963] [2025-03-04 11:03:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900725963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668144784] [2025-03-04 11:03:41,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:41,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:41,248 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:41,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:03:41,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:03:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:03:41,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:41,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:03:41,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 11:03:41,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 11:03:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668144784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:03:41,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:03:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-04 11:03:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956860713] [2025-03-04 11:03:41,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:03:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:41,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:03:41,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:03:41,565 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 11:03:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:41,843 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2025-03-04 11:03:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:03:41,844 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 96 [2025-03-04 11:03:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:41,845 INFO L225 Difference]: With dead ends: 188 [2025-03-04 11:03:41,846 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 11:03:41,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:03:41,846 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 334 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:41,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 246 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:03:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 11:03:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 158. [2025-03-04 11:03:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 133 states have (on average 1.150375939849624) internal successors, (153), 148 states have internal predecessors, (153), 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-04 11:03:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2025-03-04 11:03:41,854 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 96 [2025-03-04 11:03:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:41,854 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2025-03-04 11:03:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 11:03:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2025-03-04 11:03:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 11:03:41,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:41,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:03:41,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:03:42,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 11:03:42,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:42,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 520759033, now seen corresponding path program 1 times [2025-03-04 11:03:42,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:42,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320463813] [2025-03-04 11:03:42,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:42,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:03:42,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:03:42,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:42,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:03:42,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320463813] [2025-03-04 11:03:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320463813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499918763] [2025-03-04 11:03:42,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:42,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:42,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:42,113 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:42,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:03:42,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:03:42,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:03:42,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:42,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:42,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:03:42,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:03:42,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:03:42,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499918763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:03:42,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:03:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2025-03-04 11:03:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871961015] [2025-03-04 11:03:42,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:42,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:03:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:42,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:03:42,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:03:42,521 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 18 states, 17 states have (on average 11.882352941176471) internal successors, (202), 18 states have internal predecessors, (202), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-04 11:03:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:42,961 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2025-03-04 11:03:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 11:03:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 11.882352941176471) internal successors, (202), 18 states have internal predecessors, (202), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 97 [2025-03-04 11:03:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:42,965 INFO L225 Difference]: With dead ends: 181 [2025-03-04 11:03:42,965 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 11:03:42,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:03:42,966 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 255 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:42,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 159 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:03:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 11:03:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 156. [2025-03-04 11:03:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 146 states have internal predecessors, (150), 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-04 11:03:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2025-03-04 11:03:42,975 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 97 [2025-03-04 11:03:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:42,976 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2025-03-04 11:03:42,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 11.882352941176471) internal successors, (202), 18 states have internal predecessors, (202), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-04 11:03:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2025-03-04 11:03:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 11:03:42,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:42,976 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:03:42,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:43,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:43,181 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:43,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1860547958, now seen corresponding path program 1 times [2025-03-04 11:03:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:43,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791384275] [2025-03-04 11:03:43,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:43,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 11:03:43,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 11:03:43,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:43,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:03:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180187214] [2025-03-04 11:03:43,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:43,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:43,200 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:43,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:03:43,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 11:03:43,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 11:03:43,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:43,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:43,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:03:43,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:03:43,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:43,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791384275] [2025-03-04 11:03:43,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:03:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180187214] [2025-03-04 11:03:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180187214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:43,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:03:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 11:03:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168079275] [2025-03-04 11:03:43,788 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:43,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:03:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:43,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:03:43,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:03:43,789 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:03:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:44,081 INFO L93 Difference]: Finished difference Result 246 states and 257 transitions. [2025-03-04 11:03:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:03:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 101 [2025-03-04 11:03:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:44,082 INFO L225 Difference]: With dead ends: 246 [2025-03-04 11:03:44,082 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 11:03:44,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:03:44,083 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 94 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:44,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 279 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:03:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 11:03:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 11:03:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.1219512195121952) internal successors, (138), 136 states have internal predecessors, (138), 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-04 11:03:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2025-03-04 11:03:44,089 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 101 [2025-03-04 11:03:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2025-03-04 11:03:44,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:03:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2025-03-04 11:03:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 11:03:44,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:03:44,090 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:03:44,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:03:44,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:44,295 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 11:03:44,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:03:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash 883518867, now seen corresponding path program 1 times [2025-03-04 11:03:44,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:03:44,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567883764] [2025-03-04 11:03:44,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:03:44,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 11:03:44,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 11:03:44,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:44,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:03:44,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135933696] [2025-03-04 11:03:44,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:03:44,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:03:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:03:44,308 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:03:44,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:03:44,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 11:03:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 11:03:44,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:03:44,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:03:44,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:03:44,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:03:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:03:44,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:03:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:03:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567883764] [2025-03-04 11:03:45,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:03:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135933696] [2025-03-04 11:03:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135933696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:03:45,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:03:45,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 11:03:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137457563] [2025-03-04 11:03:45,676 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:03:45,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:03:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:03:45,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:03:45,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:03:45,677 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:03:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:03:46,174 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2025-03-04 11:03:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:03:46,175 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 103 [2025-03-04 11:03:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:03:46,175 INFO L225 Difference]: With dead ends: 150 [2025-03-04 11:03:46,175 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:03:46,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:03:46,176 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:03:46,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 218 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:03:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:03:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:03:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:03:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:03:46,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2025-03-04 11:03:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:03:46,177 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:03:46,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:03:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:03:46,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:03:46,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 56 remaining) [2025-03-04 11:03:46,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 56 remaining) [2025-03-04 11:03:46,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 56 remaining) [2025-03-04 11:03:46,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 56 remaining) [2025-03-04 11:03:46,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 56 remaining) [2025-03-04 11:03:46,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:03:46,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:03:46,389 INFO L422 BasicCegarLoop]: Path program histogram: [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-04 11:03:46,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:03:51,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:03:51,231 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:03:51,232 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:03:51,232 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:03:51,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:03:51 BoogieIcfgContainer [2025-03-04 11:03:51,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:03:51,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:03:51,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:03:51,236 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:03:51,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:03:17" (3/4) ... [2025-03-04 11:03:51,238 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:03:51,243 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:03:51,243 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:03:51,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 11:03:51,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:03:51,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:03:51,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:03:51,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:03:51,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:03:51,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:03:51,311 INFO L158 Benchmark]: Toolchain (without parser) took 34449.97ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 112.2MB in the beginning and 301.8MB in the end (delta: -189.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2025-03-04 11:03:51,311 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:03:51,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.62ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:03:51,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.51ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:03:51,312 INFO L158 Benchmark]: Boogie Preprocessor took 20.91ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:03:51,312 INFO L158 Benchmark]: IcfgBuilder took 422.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 78.2MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:03:51,312 INFO L158 Benchmark]: TraceAbstraction took 33763.90ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 77.8MB in the beginning and 310.0MB in the end (delta: -232.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-03-04 11:03:51,312 INFO L158 Benchmark]: Witness Printer took 74.71ms. Allocated memory is still 377.5MB. Free memory was 310.0MB in the beginning and 301.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:03:51,313 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.62ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.51ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.91ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 422.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 78.2MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33763.90ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 77.8MB in the beginning and 310.0MB in the end (delta: -232.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 74.71ms. Allocated memory is still 377.5MB. Free memory was 310.0MB in the beginning and 301.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 137 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2396 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2377 mSDsluCounter, 5620 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3926 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5583 IncrementalHoareTripleChecker+Invalid, 5790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 1694 mSDtfsCounter, 5583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1763 GetRequests, 1536 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=12, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 177 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 2356 NumberOfCodeBlocks, 2356 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2396 ConstructedInterpolants, 55 QuantifiedInterpolants, 11756 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1754 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 952/1230 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 56 specifications checked. All of them hold - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((__int128) u * u) <= 9223372036854775807)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (v == 1)) && (((__int128) r + 4) <= (((((__int128) r + 1) >= 0) ? (((__int128) r + 1) % 2) : ((((__int128) r + 1) % 2) + 2)) + u))) && (A <= 1)) && (0 <= A)) || ((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (v == 1)) && (A <= 1)) && ((2 + (((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)))) <= u))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:03:51,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE