./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:38:01,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:38:01,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:38:01,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:38:01,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:38:01,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:38:01,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:38:01,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:38:01,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:38:01,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:38:01,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:38:01,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:38:01,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:38:01,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:38:01,847 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:38:01,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:38:01,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:38:01,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:38:01,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:38:01,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:38:01,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:38:01,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:38:01,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:38:01,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:38:01,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:38:01,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:38:01,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:38:01,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:38:01,850 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-jdk21/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 -> 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f [2025-02-06 14:38:02,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:38:02,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:38:02,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:38:02,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:38:02,093 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:38:02,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2025-02-06 14:38:03,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/798626aad/a59657d5c93e430aa0396559e75e31a0/FLAGc39ee6b65 [2025-02-06 14:38:03,548 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:38:03,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2025-02-06 14:38:03,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/798626aad/a59657d5c93e430aa0396559e75e31a0/FLAGc39ee6b65 [2025-02-06 14:38:03,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/798626aad/a59657d5c93e430aa0396559e75e31a0 [2025-02-06 14:38:03,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:38:03,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:38:03,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:38:03,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:38:03,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:38:03,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203238d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03, skipping insertion in model container [2025-02-06 14:38:03,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:38:03,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:38:03,758 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:38:03,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:38:03,803 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:38:03,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03 WrapperNode [2025-02-06 14:38:03,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:38:03,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:38:03,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:38:03,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:38:03,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,844 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 234 [2025-02-06 14:38:03,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:38:03,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:38:03,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:38:03,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:38:03,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,868 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-02-06 14:38:03,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:38:03,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:38:03,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:38:03,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:38:03,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (1/1) ... [2025-02-06 14:38:03,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:38:03,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:03,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:38:03,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:38:03,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:38:03,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:38:03,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:38:03,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:38:04,011 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:38:04,012 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:38:04,309 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-06 14:38:04,309 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:38:04,323 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:38:04,324 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:38:04,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:04 BoogieIcfgContainer [2025-02-06 14:38:04,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:38:04,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:38:04,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:38:04,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:38:04,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:38:03" (1/3) ... [2025-02-06 14:38:04,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fc01d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:04, skipping insertion in model container [2025-02-06 14:38:04,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:03" (2/3) ... [2025-02-06 14:38:04,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fc01d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:04, skipping insertion in model container [2025-02-06 14:38:04,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:04" (3/3) ... [2025-02-06 14:38:04,332 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c [2025-02-06 14:38:04,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:38:04,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c that has 1 procedures, 84 locations, 1 initial locations, 1 loop locations, and 14 error locations. [2025-02-06 14:38:04,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:38:04,393 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;@1e78b5f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:38:04,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 14:38:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 83 states have internal predecessors, (120), 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-02-06 14:38:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 14:38:04,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:04,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:04,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:04,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1577346987, now seen corresponding path program 1 times [2025-02-06 14:38:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:04,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276144351] [2025-02-06 14:38:04,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:04,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:04,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 14:38:04,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 14:38:04,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:04,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276144351] [2025-02-06 14:38:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276144351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:04,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:04,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:38:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376809150] [2025-02-06 14:38:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:04,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:38:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:04,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:38:04,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:38:04,587 INFO L87 Difference]: Start difference. First operand has 84 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 83 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-06 14:38:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:04,602 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2025-02-06 14:38:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:38:04,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 14:38:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:04,610 INFO L225 Difference]: With dead ends: 141 [2025-02-06 14:38:04,610 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 14:38:04,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02-06 14:38:04,617 INFO L435 NwaCegarLoop]: 112 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, 112 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-02-06 14:38:04,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 14:38:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 14:38:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 76 states have internal predecessors, (111), 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-02-06 14:38:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-02-06 14:38:04,647 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 11 [2025-02-06 14:38:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:04,649 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-02-06 14:38:04,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-06 14:38:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-02-06 14:38:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:38:04,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:04,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:04,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:38:04,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:04,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash 934619953, now seen corresponding path program 1 times [2025-02-06 14:38:04,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:04,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568071764] [2025-02-06 14:38:04,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:04,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:38:04,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:38:04,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:04,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:04,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:04,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568071764] [2025-02-06 14:38:04,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568071764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:04,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:04,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:38:04,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87918143] [2025-02-06 14:38:04,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:04,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:04,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:04,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:04,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:04,815 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:38:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:04,853 INFO L93 Difference]: Finished difference Result 136 states and 188 transitions. [2025-02-06 14:38:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:04,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 14:38:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:04,854 INFO L225 Difference]: With dead ends: 136 [2025-02-06 14:38:04,854 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 14:38:04,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 14:38:04,855 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:04,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 14:38:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 14:38:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 76 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:38:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2025-02-06 14:38:04,859 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 15 [2025-02-06 14:38:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:04,859 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2025-02-06 14:38:04,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:38:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2025-02-06 14:38:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:38:04,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:04,860 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:38:04,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1824979174, now seen corresponding path program 1 times [2025-02-06 14:38:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:04,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052273780] [2025-02-06 14:38:04,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:04,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:38:04,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:38:04,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:04,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052273780] [2025-02-06 14:38:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052273780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957541572] [2025-02-06 14:38:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:04,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:04,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:04,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:04,972 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-02-06 14:38:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:05,082 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2025-02-06 14:38:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 14:38:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:05,085 INFO L225 Difference]: With dead ends: 129 [2025-02-06 14:38:05,085 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 14:38:05,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 14:38:05,086 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 216 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:05,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 113 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 14:38:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-02-06 14:38:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 119 states have internal predecessors, (165), 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-02-06 14:38:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2025-02-06 14:38:05,100 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 30 [2025-02-06 14:38:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:05,100 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2025-02-06 14:38:05,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-02-06 14:38:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2025-02-06 14:38:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:38:05,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:05,103 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:05,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:38:05,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:05,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash 739779558, now seen corresponding path program 1 times [2025-02-06 14:38:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937116947] [2025-02-06 14:38:05,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:05,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:38:05,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:38:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:05,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937116947] [2025-02-06 14:38:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937116947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864411655] [2025-02-06 14:38:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:05,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:05,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:05,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:05,200 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-02-06 14:38:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:05,316 INFO L93 Difference]: Finished difference Result 224 states and 305 transitions. [2025-02-06 14:38:05,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:05,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 14:38:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:05,318 INFO L225 Difference]: With dead ends: 224 [2025-02-06 14:38:05,320 INFO L226 Difference]: Without dead ends: 221 [2025-02-06 14:38:05,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 14:38:05,321 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 206 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:05,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 167 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-06 14:38:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 163. [2025-02-06 14:38:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.5364238410596027) internal successors, (232), 162 states have internal predecessors, (232), 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-02-06 14:38:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 232 transitions. [2025-02-06 14:38:05,337 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 232 transitions. Word has length 31 [2025-02-06 14:38:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:05,338 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 232 transitions. [2025-02-06 14:38:05,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-02-06 14:38:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 232 transitions. [2025-02-06 14:38:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:38:05,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:05,341 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:05,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:38:05,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:05,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1458329828, now seen corresponding path program 1 times [2025-02-06 14:38:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694820850] [2025-02-06 14:38:05,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:05,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:38:05,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:38:05,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:05,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694820850] [2025-02-06 14:38:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694820850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475894830] [2025-02-06 14:38:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:05,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:05,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:05,451 INFO L87 Difference]: Start difference. First operand 163 states and 232 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-02-06 14:38:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:05,631 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2025-02-06 14:38:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:38:05,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 14:38:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:05,633 INFO L225 Difference]: With dead ends: 264 [2025-02-06 14:38:05,635 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 14:38:05,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:38:05,636 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 471 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:05,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 195 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 14:38:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2025-02-06 14:38:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 237 states have (on average 1.5443037974683544) internal successors, (366), 248 states have internal predecessors, (366), 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-02-06 14:38:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 366 transitions. [2025-02-06 14:38:05,648 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 366 transitions. Word has length 32 [2025-02-06 14:38:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:05,648 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 366 transitions. [2025-02-06 14:38:05,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-02-06 14:38:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2025-02-06 14:38:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 14:38:05,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:05,649 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:05,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:38:05,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:05,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2036415580, now seen corresponding path program 1 times [2025-02-06 14:38:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233111644] [2025-02-06 14:38:05,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:05,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 14:38:05,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 14:38:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:05,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:05,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233111644] [2025-02-06 14:38:05,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233111644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:05,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:05,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:05,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473462079] [2025-02-06 14:38:05,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:05,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:05,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:05,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:05,767 INFO L87 Difference]: Start difference. First operand 249 states and 366 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-02-06 14:38:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:05,963 INFO L93 Difference]: Finished difference Result 755 states and 1115 transitions. [2025-02-06 14:38:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:38:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-06 14:38:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:05,965 INFO L225 Difference]: With dead ends: 755 [2025-02-06 14:38:05,966 INFO L226 Difference]: Without dead ends: 528 [2025-02-06 14:38:05,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:38:05,967 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 416 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:05,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 346 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:38:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-06 14:38:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2025-02-06 14:38:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 366 states have (on average 1.5081967213114753) internal successors, (552), 377 states have internal predecessors, (552), 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-02-06 14:38:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 552 transitions. [2025-02-06 14:38:05,987 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 552 transitions. Word has length 33 [2025-02-06 14:38:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:05,988 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 552 transitions. [2025-02-06 14:38:05,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-02-06 14:38:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 552 transitions. [2025-02-06 14:38:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 14:38:05,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:05,988 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:05,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:38:05,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:05,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2125147402, now seen corresponding path program 1 times [2025-02-06 14:38:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666468427] [2025-02-06 14:38:05,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:05,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 14:38:06,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 14:38:06,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:06,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:06,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:06,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666468427] [2025-02-06 14:38:06,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666468427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:06,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416279173] [2025-02-06 14:38:06,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:06,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:06,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:06,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:06,049 INFO L87 Difference]: Start difference. First operand 378 states and 552 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-06 14:38:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:06,071 INFO L93 Difference]: Finished difference Result 1058 states and 1556 transitions. [2025-02-06 14:38:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 14:38:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:06,074 INFO L225 Difference]: With dead ends: 1058 [2025-02-06 14:38:06,076 INFO L226 Difference]: Without dead ends: 702 [2025-02-06 14:38:06,077 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-02-06 14:38:06,078 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:06,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-06 14:38:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 690. [2025-02-06 14:38:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 678 states have (on average 1.5014749262536873) internal successors, (1018), 689 states have internal predecessors, (1018), 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-02-06 14:38:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1018 transitions. [2025-02-06 14:38:06,105 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1018 transitions. Word has length 35 [2025-02-06 14:38:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:06,105 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1018 transitions. [2025-02-06 14:38:06,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-06 14:38:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1018 transitions. [2025-02-06 14:38:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 14:38:06,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:06,106 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:38:06,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:06,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -629459192, now seen corresponding path program 1 times [2025-02-06 14:38:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930896284] [2025-02-06 14:38:06,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:06,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 14:38:06,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 14:38:06,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:06,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:06,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930896284] [2025-02-06 14:38:06,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930896284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:06,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:06,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811454383] [2025-02-06 14:38:06,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:06,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:06,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:06,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:06,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:06,140 INFO L87 Difference]: Start difference. First operand 690 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-06 14:38:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:06,165 INFO L93 Difference]: Finished difference Result 1962 states and 2898 transitions. [2025-02-06 14:38:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-06 14:38:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:06,171 INFO L225 Difference]: With dead ends: 1962 [2025-02-06 14:38:06,171 INFO L226 Difference]: Without dead ends: 1294 [2025-02-06 14:38:06,172 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-02-06 14:38:06,172 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:06,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-02-06 14:38:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1282. [2025-02-06 14:38:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1270 states have (on average 1.48503937007874) internal successors, (1886), 1281 states have internal predecessors, (1886), 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-02-06 14:38:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1886 transitions. [2025-02-06 14:38:06,214 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1886 transitions. Word has length 37 [2025-02-06 14:38:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:06,215 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1886 transitions. [2025-02-06 14:38:06,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-06 14:38:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1886 transitions. [2025-02-06 14:38:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 14:38:06,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:06,219 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:06,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:38:06,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:06,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2037323999, now seen corresponding path program 1 times [2025-02-06 14:38:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548280700] [2025-02-06 14:38:06,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:06,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 14:38:06,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 14:38:06,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:06,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548280700] [2025-02-06 14:38:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548280700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815934874] [2025-02-06 14:38:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:06,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:06,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:06,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:06,271 INFO L87 Difference]: Start difference. First operand 1282 states and 1886 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-06 14:38:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:06,324 INFO L93 Difference]: Finished difference Result 3578 states and 5262 transitions. [2025-02-06 14:38:06,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:06,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-06 14:38:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:06,333 INFO L225 Difference]: With dead ends: 3578 [2025-02-06 14:38:06,334 INFO L226 Difference]: Without dead ends: 2318 [2025-02-06 14:38:06,336 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-02-06 14:38:06,337 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:06,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-02-06 14:38:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2306. [2025-02-06 14:38:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2294 states have (on average 1.4673060156931124) internal successors, (3366), 2305 states have internal predecessors, (3366), 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-02-06 14:38:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3366 transitions. [2025-02-06 14:38:06,391 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3366 transitions. Word has length 37 [2025-02-06 14:38:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:06,392 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3366 transitions. [2025-02-06 14:38:06,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-06 14:38:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3366 transitions. [2025-02-06 14:38:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 14:38:06,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:06,393 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 14:38:06,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:38:06,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:06,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:06,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1077958289, now seen corresponding path program 1 times [2025-02-06 14:38:06,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:06,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286347910] [2025-02-06 14:38:06,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:06,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 14:38:06,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 14:38:06,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:06,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286347910] [2025-02-06 14:38:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286347910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:06,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:06,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300966955] [2025-02-06 14:38:06,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:06,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:06,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:06,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:06,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:06,461 INFO L87 Difference]: Start difference. First operand 2306 states and 3366 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02-06 14:38:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:06,510 INFO L93 Difference]: Finished difference Result 5186 states and 7536 transitions. [2025-02-06 14:38:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-06 14:38:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:06,520 INFO L225 Difference]: With dead ends: 5186 [2025-02-06 14:38:06,520 INFO L226 Difference]: Without dead ends: 2902 [2025-02-06 14:38:06,523 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-02-06 14:38:06,524 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:06,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 157 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2025-02-06 14:38:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2856. [2025-02-06 14:38:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2844 states have (on average 1.4430379746835442) internal successors, (4104), 2855 states have internal predecessors, (4104), 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-02-06 14:38:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4104 transitions. [2025-02-06 14:38:06,610 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4104 transitions. Word has length 53 [2025-02-06 14:38:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:06,610 INFO L471 AbstractCegarLoop]: Abstraction has 2856 states and 4104 transitions. [2025-02-06 14:38:06,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02-06 14:38:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4104 transitions. [2025-02-06 14:38:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 14:38:06,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:06,611 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-06 14:38:06,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:38:06,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1371826912, now seen corresponding path program 1 times [2025-02-06 14:38:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760735791] [2025-02-06 14:38:06,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:06,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 14:38:06,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 14:38:06,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:06,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:06,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:06,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760735791] [2025-02-06 14:38:06,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760735791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:06,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:06,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:38:06,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628236629] [2025-02-06 14:38:06,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:06,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:06,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:06,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:06,767 INFO L87 Difference]: Start difference. First operand 2856 states and 4104 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-02-06 14:38:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:06,914 INFO L93 Difference]: Finished difference Result 5694 states and 8184 transitions. [2025-02-06 14:38:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-06 14:38:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:06,923 INFO L225 Difference]: With dead ends: 5694 [2025-02-06 14:38:06,923 INFO L226 Difference]: Without dead ends: 2862 [2025-02-06 14:38:06,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:38:06,928 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:06,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 214 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-02-06 14:38:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2856. [2025-02-06 14:38:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2844 states have (on average 1.431786216596343) internal successors, (4072), 2855 states have internal predecessors, (4072), 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-02-06 14:38:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4072 transitions. [2025-02-06 14:38:07,016 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4072 transitions. Word has length 57 [2025-02-06 14:38:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:07,017 INFO L471 AbstractCegarLoop]: Abstraction has 2856 states and 4072 transitions. [2025-02-06 14:38:07,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-02-06 14:38:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4072 transitions. [2025-02-06 14:38:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 14:38:07,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:07,018 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-02-06 14:38:07,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:38:07,019 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:07,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 896041899, now seen corresponding path program 1 times [2025-02-06 14:38:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388446726] [2025-02-06 14:38:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:07,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 14:38:07,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 14:38:07,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:07,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:38:07,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:07,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388446726] [2025-02-06 14:38:07,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388446726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:07,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406722613] [2025-02-06 14:38:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:07,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:07,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:07,128 INFO L87 Difference]: Start difference. First operand 2856 states and 4072 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-02-06 14:38:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:07,253 INFO L93 Difference]: Finished difference Result 3720 states and 5320 transitions. [2025-02-06 14:38:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:07,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-06 14:38:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:07,263 INFO L225 Difference]: With dead ends: 3720 [2025-02-06 14:38:07,263 INFO L226 Difference]: Without dead ends: 3717 [2025-02-06 14:38:07,265 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-02-06 14:38:07,266 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 96 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:07,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 221 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2025-02-06 14:38:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 2920. [2025-02-06 14:38:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2908 states have (on average 1.4429160935350756) internal successors, (4196), 2919 states have internal predecessors, (4196), 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-02-06 14:38:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4196 transitions. [2025-02-06 14:38:07,350 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4196 transitions. Word has length 58 [2025-02-06 14:38:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4196 transitions. [2025-02-06 14:38:07,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-02-06 14:38:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4196 transitions. [2025-02-06 14:38:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 14:38:07,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:07,352 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-06 14:38:07,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:38:07,352 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:07,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2007495103, now seen corresponding path program 1 times [2025-02-06 14:38:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730861379] [2025-02-06 14:38:07,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:07,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 14:38:07,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 14:38:07,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:07,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:38:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730861379] [2025-02-06 14:38:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730861379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:07,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529067080] [2025-02-06 14:38:07,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:07,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:07,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:07,483 INFO L87 Difference]: Start difference. First operand 2920 states and 4196 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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-02-06 14:38:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:07,672 INFO L93 Difference]: Finished difference Result 8214 states and 11904 transitions. [2025-02-06 14:38:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-06 14:38:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:07,686 INFO L225 Difference]: With dead ends: 8214 [2025-02-06 14:38:07,687 INFO L226 Difference]: Without dead ends: 5318 [2025-02-06 14:38:07,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:07,691 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 254 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:07,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 209 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2025-02-06 14:38:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 4624. [2025-02-06 14:38:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 4612 states have (on average 1.4501300954032958) internal successors, (6688), 4623 states have internal predecessors, (6688), 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-02-06 14:38:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6688 transitions. [2025-02-06 14:38:07,810 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6688 transitions. Word has length 59 [2025-02-06 14:38:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:07,810 INFO L471 AbstractCegarLoop]: Abstraction has 4624 states and 6688 transitions. [2025-02-06 14:38:07,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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-02-06 14:38:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6688 transitions. [2025-02-06 14:38:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 14:38:07,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:07,811 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 14:38:07,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 14:38:07,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:07,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2102806057, now seen corresponding path program 1 times [2025-02-06 14:38:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249682414] [2025-02-06 14:38:07,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:07,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:38:07,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:38:07,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:07,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:38:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249682414] [2025-02-06 14:38:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249682414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:07,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981795422] [2025-02-06 14:38:07,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:07,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:07,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:07,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:07,880 INFO L87 Difference]: Start difference. First operand 4624 states and 6688 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-02-06 14:38:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:08,043 INFO L93 Difference]: Finished difference Result 9227 states and 13340 transitions. [2025-02-06 14:38:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-06 14:38:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:08,058 INFO L225 Difference]: With dead ends: 9227 [2025-02-06 14:38:08,058 INFO L226 Difference]: Without dead ends: 5415 [2025-02-06 14:38:08,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:08,065 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 209 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:08,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 297 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2025-02-06 14:38:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5412. [2025-02-06 14:38:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5400 states have (on average 1.4185185185185185) internal successors, (7660), 5411 states have internal predecessors, (7660), 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-02-06 14:38:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 7660 transitions. [2025-02-06 14:38:08,201 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 7660 transitions. Word has length 60 [2025-02-06 14:38:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:08,201 INFO L471 AbstractCegarLoop]: Abstraction has 5412 states and 7660 transitions. [2025-02-06 14:38:08,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-02-06 14:38:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 7660 transitions. [2025-02-06 14:38:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 14:38:08,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:08,202 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 14:38:08,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:38:08,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:08,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash -683841175, now seen corresponding path program 1 times [2025-02-06 14:38:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:08,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003038052] [2025-02-06 14:38:08,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:08,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:38:08,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:38:08,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:38:08,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003038052] [2025-02-06 14:38:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003038052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:08,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:08,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:08,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563071413] [2025-02-06 14:38:08,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:08,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:08,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:08,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:08,288 INFO L87 Difference]: Start difference. First operand 5412 states and 7660 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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-02-06 14:38:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:08,445 INFO L93 Difference]: Finished difference Result 10015 states and 14324 transitions. [2025-02-06 14:38:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:38:08,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-06 14:38:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:08,461 INFO L225 Difference]: With dead ends: 10015 [2025-02-06 14:38:08,463 INFO L226 Difference]: Without dead ends: 5415 [2025-02-06 14:38:08,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:08,470 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 216 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:08,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 284 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2025-02-06 14:38:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5412. [2025-02-06 14:38:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5400 states have (on average 1.4103703703703703) internal successors, (7616), 5411 states have internal predecessors, (7616), 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-02-06 14:38:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 7616 transitions. [2025-02-06 14:38:08,574 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 7616 transitions. Word has length 60 [2025-02-06 14:38:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:08,574 INFO L471 AbstractCegarLoop]: Abstraction has 5412 states and 7616 transitions. [2025-02-06 14:38:08,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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-02-06 14:38:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 7616 transitions. [2025-02-06 14:38:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 14:38:08,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:08,575 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:08,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:38:08,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:08,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1689539009, now seen corresponding path program 1 times [2025-02-06 14:38:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:08,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589483868] [2025-02-06 14:38:08,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:08,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:08,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:38:08,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:38:08,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:08,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:08,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589483868] [2025-02-06 14:38:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589483868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:08,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:08,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:08,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433295585] [2025-02-06 14:38:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:08,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:08,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:08,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:08,650 INFO L87 Difference]: Start difference. First operand 5412 states and 7616 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 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-02-06 14:38:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:08,742 INFO L93 Difference]: Finished difference Result 5415 states and 7616 transitions. [2025-02-06 14:38:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-06 14:38:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:08,752 INFO L225 Difference]: With dead ends: 5415 [2025-02-06 14:38:08,752 INFO L226 Difference]: Without dead ends: 5412 [2025-02-06 14:38:08,754 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-02-06 14:38:08,755 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 107 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:08,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 167 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2025-02-06 14:38:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5409. [2025-02-06 14:38:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 5400 states have (on average 1.3837037037037037) internal successors, (7472), 5408 states have internal predecessors, (7472), 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-02-06 14:38:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7472 transitions. [2025-02-06 14:38:08,876 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7472 transitions. Word has length 60 [2025-02-06 14:38:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:08,876 INFO L471 AbstractCegarLoop]: Abstraction has 5409 states and 7472 transitions. [2025-02-06 14:38:08,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 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-02-06 14:38:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7472 transitions. [2025-02-06 14:38:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 14:38:08,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:08,877 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-06 14:38:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:38:08,877 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:08,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 836101739, now seen corresponding path program 1 times [2025-02-06 14:38:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896207209] [2025-02-06 14:38:08,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:08,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 14:38:08,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 14:38:08,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:08,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:08,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896207209] [2025-02-06 14:38:08,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896207209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:08,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087551088] [2025-02-06 14:38:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:08,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:08,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:08,962 INFO L87 Difference]: Start difference. First operand 5409 states and 7472 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-06 14:38:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:09,094 INFO L93 Difference]: Finished difference Result 7122 states and 9968 transitions. [2025-02-06 14:38:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:09,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-06 14:38:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:09,107 INFO L225 Difference]: With dead ends: 7122 [2025-02-06 14:38:09,107 INFO L226 Difference]: Without dead ends: 7119 [2025-02-06 14:38:09,109 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-02-06 14:38:09,110 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 96 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:09,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 213 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7119 states. [2025-02-06 14:38:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7119 to 7113. [2025-02-06 14:38:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7104 states have (on average 1.382882882882883) internal successors, (9824), 7112 states have internal predecessors, (9824), 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-02-06 14:38:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 9824 transitions. [2025-02-06 14:38:09,241 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 9824 transitions. Word has length 61 [2025-02-06 14:38:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:09,241 INFO L471 AbstractCegarLoop]: Abstraction has 7113 states and 9824 transitions. [2025-02-06 14:38:09,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-06 14:38:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 9824 transitions. [2025-02-06 14:38:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 14:38:09,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:09,242 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-02-06 14:38:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:38:09,243 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash 149350143, now seen corresponding path program 1 times [2025-02-06 14:38:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015506272] [2025-02-06 14:38:09,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:09,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 14:38:09,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 14:38:09,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:09,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:09,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:09,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015506272] [2025-02-06 14:38:09,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015506272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:09,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:09,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:09,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998788435] [2025-02-06 14:38:09,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:09,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:09,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:09,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:09,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:09,325 INFO L87 Difference]: Start difference. First operand 7113 states and 9824 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-02-06 14:38:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:09,485 INFO L93 Difference]: Finished difference Result 13493 states and 19124 transitions. [2025-02-06 14:38:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-06 14:38:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:09,499 INFO L225 Difference]: With dead ends: 13493 [2025-02-06 14:38:09,499 INFO L226 Difference]: Without dead ends: 8372 [2025-02-06 14:38:09,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:09,507 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 244 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:09,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 212 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8372 states. [2025-02-06 14:38:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8372 to 6937. [2025-02-06 14:38:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6937 states, 6928 states have (on average 1.388568129330254) internal successors, (9620), 6936 states have internal predecessors, (9620), 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-02-06 14:38:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 9620 transitions. [2025-02-06 14:38:09,607 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 9620 transitions. Word has length 62 [2025-02-06 14:38:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:09,607 INFO L471 AbstractCegarLoop]: Abstraction has 6937 states and 9620 transitions. [2025-02-06 14:38:09,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-02-06 14:38:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 9620 transitions. [2025-02-06 14:38:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 14:38:09,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:09,608 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-02-06 14:38:09,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 14:38:09,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:09,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 334887145, now seen corresponding path program 1 times [2025-02-06 14:38:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:09,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674885648] [2025-02-06 14:38:09,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:09,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 14:38:09,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 14:38:09,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:09,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:09,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674885648] [2025-02-06 14:38:09,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674885648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:09,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:09,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:09,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916024897] [2025-02-06 14:38:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:09,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:09,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:09,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:09,707 INFO L87 Difference]: Start difference. First operand 6937 states and 9620 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 14:38:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:09,848 INFO L93 Difference]: Finished difference Result 11777 states and 16588 transitions. [2025-02-06 14:38:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-06 14:38:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:09,859 INFO L225 Difference]: With dead ends: 11777 [2025-02-06 14:38:09,860 INFO L226 Difference]: Without dead ends: 7224 [2025-02-06 14:38:09,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:09,865 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 206 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:09,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 299 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2025-02-06 14:38:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7221. [2025-02-06 14:38:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7221 states, 7212 states have (on average 1.3838047698280644) internal successors, (9980), 7220 states have internal predecessors, (9980), 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-02-06 14:38:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7221 states to 7221 states and 9980 transitions. [2025-02-06 14:38:09,956 INFO L78 Accepts]: Start accepts. Automaton has 7221 states and 9980 transitions. Word has length 63 [2025-02-06 14:38:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:09,956 INFO L471 AbstractCegarLoop]: Abstraction has 7221 states and 9980 transitions. [2025-02-06 14:38:09,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 14:38:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7221 states and 9980 transitions. [2025-02-06 14:38:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 14:38:09,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:09,957 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:09,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 14:38:09,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:09,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash -856428787, now seen corresponding path program 1 times [2025-02-06 14:38:09,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:09,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994528280] [2025-02-06 14:38:09,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:09,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:09,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 14:38:09,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 14:38:09,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:09,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:38:10,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994528280] [2025-02-06 14:38:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994528280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792214729] [2025-02-06 14:38:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:10,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:10,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:10,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:10,053 INFO L87 Difference]: Start difference. First operand 7221 states and 9980 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-02-06 14:38:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:10,186 INFO L93 Difference]: Finished difference Result 7619 states and 10512 transitions. [2025-02-06 14:38:10,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:10,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-06 14:38:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:10,198 INFO L225 Difference]: With dead ends: 7619 [2025-02-06 14:38:10,199 INFO L226 Difference]: Without dead ends: 7616 [2025-02-06 14:38:10,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:10,202 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 165 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:10,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 277 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2025-02-06 14:38:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7613. [2025-02-06 14:38:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7613 states, 7604 states have (on average 1.374013677012099) internal successors, (10448), 7612 states have internal predecessors, (10448), 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-02-06 14:38:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 10448 transitions. [2025-02-06 14:38:10,301 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 10448 transitions. Word has length 64 [2025-02-06 14:38:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:10,302 INFO L471 AbstractCegarLoop]: Abstraction has 7613 states and 10448 transitions. [2025-02-06 14:38:10,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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-02-06 14:38:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 10448 transitions. [2025-02-06 14:38:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 14:38:10,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:10,303 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:10,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 14:38:10,303 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:10,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 319431951, now seen corresponding path program 1 times [2025-02-06 14:38:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862051234] [2025-02-06 14:38:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:10,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 14:38:10,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 14:38:10,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:10,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:10,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862051234] [2025-02-06 14:38:10,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862051234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:10,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:10,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424377641] [2025-02-06 14:38:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:10,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:10,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:10,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:10,362 INFO L87 Difference]: Start difference. First operand 7613 states and 10448 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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-02-06 14:38:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:10,523 INFO L93 Difference]: Finished difference Result 9897 states and 13776 transitions. [2025-02-06 14:38:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:10,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-06 14:38:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:10,541 INFO L225 Difference]: With dead ends: 9897 [2025-02-06 14:38:10,542 INFO L226 Difference]: Without dead ends: 9894 [2025-02-06 14:38:10,544 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-02-06 14:38:10,545 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 141 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:10,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 259 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2025-02-06 14:38:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9317. [2025-02-06 14:38:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9317 states, 9308 states have (on average 1.3596905887408681) internal successors, (12656), 9316 states have internal predecessors, (12656), 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-02-06 14:38:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 12656 transitions. [2025-02-06 14:38:10,724 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 12656 transitions. Word has length 65 [2025-02-06 14:38:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:10,724 INFO L471 AbstractCegarLoop]: Abstraction has 9317 states and 12656 transitions. [2025-02-06 14:38:10,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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-02-06 14:38:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 12656 transitions. [2025-02-06 14:38:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 14:38:10,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:10,725 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:10,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 14:38:10,726 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:10,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1312455899, now seen corresponding path program 1 times [2025-02-06 14:38:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722595958] [2025-02-06 14:38:10,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:10,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 14:38:10,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 14:38:10,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:10,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722595958] [2025-02-06 14:38:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722595958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79013768] [2025-02-06 14:38:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:10,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:10,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:10,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:10,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:10,801 INFO L87 Difference]: Start difference. First operand 9317 states and 12656 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 14:38:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:10,915 INFO L93 Difference]: Finished difference Result 11343 states and 15424 transitions. [2025-02-06 14:38:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 14:38:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:10,929 INFO L225 Difference]: With dead ends: 11343 [2025-02-06 14:38:10,929 INFO L226 Difference]: Without dead ends: 7361 [2025-02-06 14:38:10,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:10,937 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 143 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:10,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 251 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2025-02-06 14:38:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 5529. [2025-02-06 14:38:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5529 states, 5520 states have (on average 1.344927536231884) internal successors, (7424), 5528 states have internal predecessors, (7424), 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-02-06 14:38:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 7424 transitions. [2025-02-06 14:38:11,035 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 7424 transitions. Word has length 66 [2025-02-06 14:38:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:11,035 INFO L471 AbstractCegarLoop]: Abstraction has 5529 states and 7424 transitions. [2025-02-06 14:38:11,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 14:38:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 7424 transitions. [2025-02-06 14:38:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 14:38:11,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:11,036 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:11,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 14:38:11,036 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2031427213, now seen corresponding path program 1 times [2025-02-06 14:38:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126560505] [2025-02-06 14:38:11,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:11,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 14:38:11,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 14:38:11,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:11,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:11,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:11,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126560505] [2025-02-06 14:38:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126560505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533586366] [2025-02-06 14:38:11,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:11,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:11,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:11,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:11,112 INFO L87 Difference]: Start difference. First operand 5529 states and 7424 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-02-06 14:38:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:11,245 INFO L93 Difference]: Finished difference Result 6579 states and 8920 transitions. [2025-02-06 14:38:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 14:38:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:11,256 INFO L225 Difference]: With dead ends: 6579 [2025-02-06 14:38:11,257 INFO L226 Difference]: Without dead ends: 6578 [2025-02-06 14:38:11,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:11,259 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 137 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:11,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 349 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6578 states. [2025-02-06 14:38:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6578 to 6569. [2025-02-06 14:38:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6569 states, 6560 states have (on average 1.3585365853658538) internal successors, (8912), 6568 states have internal predecessors, (8912), 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-02-06 14:38:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 8912 transitions. [2025-02-06 14:38:11,348 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 8912 transitions. Word has length 67 [2025-02-06 14:38:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:11,348 INFO L471 AbstractCegarLoop]: Abstraction has 6569 states and 8912 transitions. [2025-02-06 14:38:11,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-02-06 14:38:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 8912 transitions. [2025-02-06 14:38:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 14:38:11,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:11,349 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 14:38:11,349 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash -755220019, now seen corresponding path program 1 times [2025-02-06 14:38:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:11,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677655815] [2025-02-06 14:38:11,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:11,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 14:38:11,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 14:38:11,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:11,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677655815] [2025-02-06 14:38:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677655815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:11,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:11,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:11,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533605047] [2025-02-06 14:38:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:11,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:11,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:11,426 INFO L87 Difference]: Start difference. First operand 6569 states and 8912 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-02-06 14:38:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:11,588 INFO L93 Difference]: Finished difference Result 6859 states and 9304 transitions. [2025-02-06 14:38:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 14:38:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:11,599 INFO L225 Difference]: With dead ends: 6859 [2025-02-06 14:38:11,599 INFO L226 Difference]: Without dead ends: 6856 [2025-02-06 14:38:11,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:11,601 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 140 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:11,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 345 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6856 states. [2025-02-06 14:38:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6856 to 6853. [2025-02-06 14:38:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 6844 states have (on average 1.3559322033898304) internal successors, (9280), 6852 states have internal predecessors, (9280), 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-02-06 14:38:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 9280 transitions. [2025-02-06 14:38:11,679 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 9280 transitions. Word has length 67 [2025-02-06 14:38:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:11,679 INFO L471 AbstractCegarLoop]: Abstraction has 6853 states and 9280 transitions. [2025-02-06 14:38:11,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-02-06 14:38:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 9280 transitions. [2025-02-06 14:38:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 14:38:11,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:11,680 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:11,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 14:38:11,680 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:11,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1559759503, now seen corresponding path program 1 times [2025-02-06 14:38:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212343328] [2025-02-06 14:38:11,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:11,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 14:38:11,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 14:38:11,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:11,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:11,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:11,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212343328] [2025-02-06 14:38:11,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212343328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:11,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426653586] [2025-02-06 14:38:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:11,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:11,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:11,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:11,747 INFO L87 Difference]: Start difference. First operand 6853 states and 9280 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-02-06 14:38:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:11,893 INFO L93 Difference]: Finished difference Result 7046 states and 9528 transitions. [2025-02-06 14:38:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 14:38:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:11,903 INFO L225 Difference]: With dead ends: 7046 [2025-02-06 14:38:11,904 INFO L226 Difference]: Without dead ends: 6669 [2025-02-06 14:38:11,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:11,906 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 136 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:11,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 478 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2025-02-06 14:38:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 6665. [2025-02-06 14:38:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6656 states have (on average 1.3551682692307692) internal successors, (9020), 6664 states have internal predecessors, (9020), 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-02-06 14:38:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9020 transitions. [2025-02-06 14:38:12,031 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9020 transitions. Word has length 71 [2025-02-06 14:38:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:12,031 INFO L471 AbstractCegarLoop]: Abstraction has 6665 states and 9020 transitions. [2025-02-06 14:38:12,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-02-06 14:38:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9020 transitions. [2025-02-06 14:38:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 14:38:12,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:12,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:12,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 14:38:12,034 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:12,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 279652915, now seen corresponding path program 1 times [2025-02-06 14:38:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:12,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722500958] [2025-02-06 14:38:12,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:12,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 14:38:12,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 14:38:12,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:12,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:38:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:12,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722500958] [2025-02-06 14:38:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722500958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:12,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794796962] [2025-02-06 14:38:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:12,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:12,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:12,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:12,089 INFO L87 Difference]: Start difference. First operand 6665 states and 9020 transitions. Second operand has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 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-02-06 14:38:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:12,207 INFO L93 Difference]: Finished difference Result 6859 states and 9264 transitions. [2025-02-06 14:38:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:12,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-06 14:38:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:12,217 INFO L225 Difference]: With dead ends: 6859 [2025-02-06 14:38:12,217 INFO L226 Difference]: Without dead ends: 6856 [2025-02-06 14:38:12,218 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-02-06 14:38:12,218 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 95 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:12,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 328 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6856 states. [2025-02-06 14:38:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6856 to 6662. [2025-02-06 14:38:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6656 states have (on average 1.3191105769230769) internal successors, (8780), 6661 states have internal predecessors, (8780), 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-02-06 14:38:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 8780 transitions. [2025-02-06 14:38:12,305 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 8780 transitions. Word has length 85 [2025-02-06 14:38:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:12,305 INFO L471 AbstractCegarLoop]: Abstraction has 6662 states and 8780 transitions. [2025-02-06 14:38:12,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 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-02-06 14:38:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 8780 transitions. [2025-02-06 14:38:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 14:38:12,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:12,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-02-06 14:38:12,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 14:38:12,308 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:12,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash 267851747, now seen corresponding path program 1 times [2025-02-06 14:38:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:12,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618404365] [2025-02-06 14:38:12,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:12,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:12,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 14:38:12,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 14:38:12,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:38:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618404365] [2025-02-06 14:38:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618404365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:12,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:12,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891825979] [2025-02-06 14:38:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:12,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:12,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:12,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:12,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:12,385 INFO L87 Difference]: Start difference. First operand 6662 states and 8780 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-02-06 14:38:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:12,529 INFO L93 Difference]: Finished difference Result 7057 states and 9280 transitions. [2025-02-06 14:38:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:12,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-06 14:38:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:12,540 INFO L225 Difference]: With dead ends: 7057 [2025-02-06 14:38:12,541 INFO L226 Difference]: Without dead ends: 7054 [2025-02-06 14:38:12,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:12,543 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 118 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:12,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 299 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2025-02-06 14:38:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6270. [2025-02-06 14:38:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6270 states, 6264 states have (on average 1.3167305236270754) internal successors, (8248), 6269 states have internal predecessors, (8248), 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-02-06 14:38:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6270 states to 6270 states and 8248 transitions. [2025-02-06 14:38:12,670 INFO L78 Accepts]: Start accepts. Automaton has 6270 states and 8248 transitions. Word has length 86 [2025-02-06 14:38:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:12,670 INFO L471 AbstractCegarLoop]: Abstraction has 6270 states and 8248 transitions. [2025-02-06 14:38:12,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-02-06 14:38:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6270 states and 8248 transitions. [2025-02-06 14:38:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 14:38:12,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:12,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 14:38:12,673 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:12,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488015, now seen corresponding path program 1 times [2025-02-06 14:38:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:12,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502705298] [2025-02-06 14:38:12,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:12,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 14:38:12,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 14:38:12,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:12,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:38:12,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:12,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502705298] [2025-02-06 14:38:12,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502705298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:12,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:12,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:12,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959305343] [2025-02-06 14:38:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:12,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:12,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:12,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:12,779 INFO L87 Difference]: Start difference. First operand 6270 states and 8248 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-02-06 14:38:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:12,961 INFO L93 Difference]: Finished difference Result 9597 states and 12728 transitions. [2025-02-06 14:38:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:12,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-06 14:38:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:12,973 INFO L225 Difference]: With dead ends: 9597 [2025-02-06 14:38:12,973 INFO L226 Difference]: Without dead ends: 5791 [2025-02-06 14:38:12,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:12,980 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 138 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:12,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 380 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2025-02-06 14:38:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 5782. [2025-02-06 14:38:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5776 states have (on average 1.3109418282548477) internal successors, (7572), 5781 states have internal predecessors, (7572), 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-02-06 14:38:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 7572 transitions. [2025-02-06 14:38:13,083 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 7572 transitions. Word has length 87 [2025-02-06 14:38:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 7572 transitions. [2025-02-06 14:38:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-02-06 14:38:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 7572 transitions. [2025-02-06 14:38:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 14:38:13,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:13,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:13,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 14:38:13,086 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 600366113, now seen corresponding path program 2 times [2025-02-06 14:38:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889369434] [2025-02-06 14:38:13,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:38:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:13,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-06 14:38:13,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 14:38:13,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:38:13,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889369434] [2025-02-06 14:38:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889369434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:38:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332920592] [2025-02-06 14:38:13,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:38:13,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:13,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:38:13,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:38:13,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-06 14:38:13,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 14:38:13,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:38:13,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:13,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:38:13,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:38:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:38:13,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:38:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332920592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:38:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 14:38:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44321571] [2025-02-06 14:38:13,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:13,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:13,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:13,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:13,395 INFO L87 Difference]: Start difference. First operand 5782 states and 7572 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-02-06 14:38:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:13,482 INFO L93 Difference]: Finished difference Result 5785 states and 7572 transitions. [2025-02-06 14:38:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-06 14:38:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:13,492 INFO L225 Difference]: With dead ends: 5785 [2025-02-06 14:38:13,492 INFO L226 Difference]: Without dead ends: 4838 [2025-02-06 14:38:13,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 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-02-06 14:38:13,494 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 162 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:13,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 174 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2025-02-06 14:38:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 3986. [2025-02-06 14:38:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 3980 states have (on average 1.2733668341708542) internal successors, (5068), 3985 states have internal predecessors, (5068), 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-02-06 14:38:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5068 transitions. [2025-02-06 14:38:13,564 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5068 transitions. Word has length 87 [2025-02-06 14:38:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:13,565 INFO L471 AbstractCegarLoop]: Abstraction has 3986 states and 5068 transitions. [2025-02-06 14:38:13,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-02-06 14:38:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5068 transitions. [2025-02-06 14:38:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 14:38:13,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:13,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 14:38:13,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:38:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 14:38:13,767 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 754740985, now seen corresponding path program 1 times [2025-02-06 14:38:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306147569] [2025-02-06 14:38:13,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:13,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 14:38:13,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 14:38:13,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:13,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:38:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:13,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306147569] [2025-02-06 14:38:13,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306147569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:13,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:13,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473462562] [2025-02-06 14:38:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:13,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:13,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:13,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:13,850 INFO L87 Difference]: Start difference. First operand 3986 states and 5068 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 14:38:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:13,934 INFO L93 Difference]: Finished difference Result 4450 states and 5670 transitions. [2025-02-06 14:38:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:13,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-06 14:38:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:13,937 INFO L225 Difference]: With dead ends: 4450 [2025-02-06 14:38:13,937 INFO L226 Difference]: Without dead ends: 1495 [2025-02-06 14:38:13,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:13,939 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 102 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:13,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 307 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2025-02-06 14:38:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2025-02-06 14:38:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1492 states have (on average 1.242627345844504) internal successors, (1854), 1494 states have internal predecessors, (1854), 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-02-06 14:38:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1854 transitions. [2025-02-06 14:38:13,956 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1854 transitions. Word has length 88 [2025-02-06 14:38:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:13,956 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 1854 transitions. [2025-02-06 14:38:13,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 14:38:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1854 transitions. [2025-02-06 14:38:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 14:38:13,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:13,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 14:38:13,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 14:38:13,958 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-02-06 14:38:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1554781423, now seen corresponding path program 1 times [2025-02-06 14:38:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:13,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125094443] [2025-02-06 14:38:13,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:13,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 14:38:13,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 14:38:13,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:13,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:38:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:14,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125094443] [2025-02-06 14:38:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125094443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:14,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:14,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836796692] [2025-02-06 14:38:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:14,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:14,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:14,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:14,028 INFO L87 Difference]: Start difference. First operand 1495 states and 1854 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-02-06 14:38:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:14,098 INFO L93 Difference]: Finished difference Result 1495 states and 1854 transitions. [2025-02-06 14:38:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:38:14,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-06 14:38:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:14,100 INFO L225 Difference]: With dead ends: 1495 [2025-02-06 14:38:14,100 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:38:14,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:14,101 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 113 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:14,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 244 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:38:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:38:14,102 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-02-06 14:38:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:38:14,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2025-02-06 14:38:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:14,102 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:38:14,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-02-06 14:38:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:38:14,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:38:14,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-02-06 14:38:14,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-02-06 14:38:14,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 14:38:14,107 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-02-06 14:38:14,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:38:18,419 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:38:18,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:38:18 BoogieIcfgContainer [2025-02-06 14:38:18,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:38:18,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:38:18,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:38:18,434 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:38:18,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:04" (3/4) ... [2025-02-06 14:38:18,435 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:38:18,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 14:38:18,447 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:38:18,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:38:18,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:38:18,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:38:18,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:38:18,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:38:18,519 INFO L158 Benchmark]: Toolchain (without parser) took 14940.55ms. Allocated memory was 167.8MB in the beginning and 906.0MB in the end (delta: 738.2MB). Free memory was 122.2MB in the beginning and 416.1MB in the end (delta: -294.0MB). Peak memory consumption was 439.6MB. Max. memory is 16.1GB. [2025-02-06 14:38:18,520 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:38:18,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.45ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 108.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:38:18,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.00ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:38:18,521 INFO L158 Benchmark]: Boogie Preprocessor took 36.58ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 105.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:38:18,521 INFO L158 Benchmark]: IcfgBuilder took 436.70ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 83.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 14:38:18,521 INFO L158 Benchmark]: TraceAbstraction took 14106.96ms. Allocated memory was 167.8MB in the beginning and 906.0MB in the end (delta: 738.2MB). Free memory was 82.2MB in the beginning and 424.4MB in the end (delta: -342.3MB). Peak memory consumption was 507.5MB. Max. memory is 16.1GB. [2025-02-06 14:38:18,521 INFO L158 Benchmark]: Witness Printer took 85.67ms. Allocated memory is still 906.0MB. Free memory was 424.4MB in the beginning and 416.1MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:38:18,523 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.97ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.45ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 108.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.00ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.58ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 105.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 436.70ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 83.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14106.96ms. Allocated memory was 167.8MB in the beginning and 906.0MB in the end (delta: 738.2MB). Free memory was 82.2MB in the beginning and 424.4MB in the end (delta: -342.3MB). Peak memory consumption was 507.5MB. Max. memory is 16.1GB. * Witness Printer took 85.67ms. Allocated memory is still 906.0MB. Free memory was 424.4MB in the beginning and 416.1MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 31, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4592 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4592 mSDsluCounter, 7980 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4141 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2987 IncrementalHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 3839 mSDtfsCounter, 2987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9317occurred in iteration=21, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 7525 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1863 NumberOfCodeBlocks, 1863 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1831 ConstructedInterpolants, 0 QuantifiedInterpolants, 7009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 32 InterpolantComputations, 31 PerfectInterpolantSequences, 434/438 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 14 specifications checked. All of them hold - InvariantResult [Line: 260]: Location Invariant Derived location invariant: (((((((((st1 == 1) && (st3 == 1)) && (st2 == 0)) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || ((((st1 == 1) && (st2 == 1)) && (st3 <= 1)) && (0 <= st3))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:38:18,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE