./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/MultCommutative-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/recursive/MultCommutative-2.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 ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:31:18,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:31:18,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:31:18,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:31:18,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:31:18,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:31:18,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:31:18,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:31:18,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:31:18,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:31:18,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:31:18,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:31:18,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:31:18,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:31:18,797 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:31:18,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:31:18,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:31:18,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:31:18,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:31:18,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:31:18,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:31:18,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:31:18,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:31:18,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:18,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:31:18,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:31:18,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:31:18,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:18,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:31:18,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:31:18,800 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 -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2025-01-10 02:31:19,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:31:19,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:31:19,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:31:19,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:31:19,053 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:31:19,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/MultCommutative-2.c [2025-01-10 02:31:20,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f951ac3c/4984ba8831fc4e76888a3c22dd6957cd/FLAG77f94400c [2025-01-10 02:31:20,354 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:31:20,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c [2025-01-10 02:31:20,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f951ac3c/4984ba8831fc4e76888a3c22dd6957cd/FLAG77f94400c [2025-01-10 02:31:20,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f951ac3c/4984ba8831fc4e76888a3c22dd6957cd [2025-01-10 02:31:20,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:31:20,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:31:20,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:31:20,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:31:20,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:31:20,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d770c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20, skipping insertion in model container [2025-01-10 02:31:20,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:31:20,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:31:20,858 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:31:20,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:31:20,881 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:31:20,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20 WrapperNode [2025-01-10 02:31:20,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:31:20,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:31:20,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:31:20,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:31:20,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,904 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-01-10 02:31:20,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:31:20,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:31:20,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:31:20,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:31:20,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,917 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-01-10 02:31:20,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:31:20,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:31:20,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:31:20,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:31:20,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (1/1) ... [2025-01-10 02:31:20,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:20,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:20,954 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-01-10 02:31:20,962 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-01-10 02:31:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:31:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-01-10 02:31:20,976 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-01-10 02:31:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:31:20,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:31:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:31:21,026 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:31:21,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:31:21,124 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-10 02:31:21,124 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:31:21,133 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:31:21,134 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:31:21,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:31:21 BoogieIcfgContainer [2025-01-10 02:31:21,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:31:21,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:31:21,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:31:21,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:31:21,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:31:20" (1/3) ... [2025-01-10 02:31:21,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de54802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:31:21, skipping insertion in model container [2025-01-10 02:31:21,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:20" (2/3) ... [2025-01-10 02:31:21,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de54802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:31:21, skipping insertion in model container [2025-01-10 02:31:21,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:31:21" (3/3) ... [2025-01-10 02:31:21,141 INFO L128 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2025-01-10 02:31:21,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:31:21,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG MultCommutative-2.c that has 2 procedures, 35 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-01-10 02:31:21,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:31:21,190 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;@1ce81f0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:31:21,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 02:31:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:31:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:31:21,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:21,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:21,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 617854126, now seen corresponding path program 1 times [2025-01-10 02:31:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891130681] [2025-01-10 02:31:21,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:21,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:31:21,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:31:21,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:21,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891130681] [2025-01-10 02:31:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891130681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:21,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:21,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:31:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764686872] [2025-01-10 02:31:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:21,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:31:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:21,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:31:21,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:31:21,365 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:21,409 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-01-10 02:31:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:31:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 02:31:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:21,417 INFO L225 Difference]: With dead ends: 40 [2025-01-10 02:31:21,417 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 02:31:21,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:31:21,422 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:21,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 02:31:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-01-10 02:31:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:31:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-01-10 02:31:21,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2025-01-10 02:31:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:21,458 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-01-10 02:31:21,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-01-10 02:31:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:31:21,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:21,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:21,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:31:21,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:21,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1973608759, now seen corresponding path program 1 times [2025-01-10 02:31:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585502854] [2025-01-10 02:31:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:21,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:31:21,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:31:21,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:21,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585502854] [2025-01-10 02:31:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585502854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329949655] [2025-01-10 02:31:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:21,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:21,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:21,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:21,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:21,539 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:21,621 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-01-10 02:31:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:31:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:31:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:21,623 INFO L225 Difference]: With dead ends: 66 [2025-01-10 02:31:21,623 INFO L226 Difference]: Without dead ends: 44 [2025-01-10 02:31:21,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:31:21,624 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:21,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-10 02:31:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2025-01-10 02:31:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:31:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-01-10 02:31:21,633 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 9 [2025-01-10 02:31:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:21,633 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-01-10 02:31:21,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-01-10 02:31:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:31:21,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:21,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:31:21,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:21,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1052546898, now seen corresponding path program 1 times [2025-01-10 02:31:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237204796] [2025-01-10 02:31:21,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:21,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:31:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:31:21,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:21,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237204796] [2025-01-10 02:31:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237204796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:21,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797817272] [2025-01-10 02:31:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:21,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:21,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:21,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:21,690 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:21,763 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-01-10 02:31:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:31:21,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 02:31:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:21,765 INFO L225 Difference]: With dead ends: 62 [2025-01-10 02:31:21,765 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 02:31:21,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:31:21,765 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:21,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 81 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 02:31:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2025-01-10 02:31:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:31:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2025-01-10 02:31:21,777 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 10 [2025-01-10 02:31:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:21,778 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2025-01-10 02:31:21,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2025-01-10 02:31:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:31:21,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:21,778 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:21,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:31:21,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash -749777878, now seen corresponding path program 1 times [2025-01-10 02:31:21,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:21,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009614778] [2025-01-10 02:31:21,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:21,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:31:21,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:31:21,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:21,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:21,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009614778] [2025-01-10 02:31:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009614778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:21,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644544396] [2025-01-10 02:31:21,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:21,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:21,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:21,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:21,844 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:21,921 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2025-01-10 02:31:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:31:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:31:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:21,923 INFO L225 Difference]: With dead ends: 83 [2025-01-10 02:31:21,923 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 02:31:21,923 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-01-10 02:31:21,924 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:21,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 02:31:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2025-01-10 02:31:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:31:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-01-10 02:31:21,935 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 15 [2025-01-10 02:31:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:21,935 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-01-10 02:31:21,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2025-01-10 02:31:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:31:21,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:21,946 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:21,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:31:21,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:21,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1029564684, now seen corresponding path program 1 times [2025-01-10 02:31:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:21,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007692220] [2025-01-10 02:31:21,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:21,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:31:21,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:31:21,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:21,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007692220] [2025-01-10 02:31:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007692220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233410220] [2025-01-10 02:31:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:21,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:21,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:21,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:21,996 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:31:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:22,045 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2025-01-10 02:31:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:31:22,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 02:31:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:22,049 INFO L225 Difference]: With dead ends: 125 [2025-01-10 02:31:22,049 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 02:31:22,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:31:22,050 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:22,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 111 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 02:31:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2025-01-10 02:31:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:31:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2025-01-10 02:31:22,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 16 [2025-01-10 02:31:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:22,070 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2025-01-10 02:31:22,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:31:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2025-01-10 02:31:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 02:31:22,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:22,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:22,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:31:22,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:22,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1851951645, now seen corresponding path program 1 times [2025-01-10 02:31:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:22,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993942408] [2025-01-10 02:31:22,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:22,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 02:31:22,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 02:31:22,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:22,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993942408] [2025-01-10 02:31:22,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993942408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615091839] [2025-01-10 02:31:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:22,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:22,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:22,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:22,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:22,127 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:31:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:22,190 INFO L93 Difference]: Finished difference Result 102 states and 132 transitions. [2025-01-10 02:31:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:31:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 02:31:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:22,192 INFO L225 Difference]: With dead ends: 102 [2025-01-10 02:31:22,192 INFO L226 Difference]: Without dead ends: 101 [2025-01-10 02:31:22,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:31:22,192 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:22,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 121 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-10 02:31:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-01-10 02:31:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 02:31:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2025-01-10 02:31:22,209 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 17 [2025-01-10 02:31:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:22,211 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2025-01-10 02:31:22,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:31:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2025-01-10 02:31:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 02:31:22,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:22,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:31:22,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:22,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1700557631, now seen corresponding path program 1 times [2025-01-10 02:31:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731405506] [2025-01-10 02:31:22,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:22,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:31:22,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:31:22,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:22,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731405506] [2025-01-10 02:31:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731405506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293126757] [2025-01-10 02:31:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:22,290 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-01-10 02:31:22,292 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-01-10 02:31:22,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:31:22,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:31:22,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:22,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:22,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:31:22,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:22,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293126757] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:22,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-01-10 02:31:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278967437] [2025-01-10 02:31:22,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:22,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:31:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:22,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:31:22,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:31:22,441 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:31:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:22,535 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2025-01-10 02:31:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:31:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-01-10 02:31:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:22,538 INFO L225 Difference]: With dead ends: 157 [2025-01-10 02:31:22,539 INFO L226 Difference]: Without dead ends: 156 [2025-01-10 02:31:22,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:31:22,541 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:22,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 121 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-10 02:31:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2025-01-10 02:31:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 97 states have internal predecessors, (124), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 02:31:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2025-01-10 02:31:22,556 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 18 [2025-01-10 02:31:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:22,556 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2025-01-10 02:31:22,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:31:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2025-01-10 02:31:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:31:22,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:22,557 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:22,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:31:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:22,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:22,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash -490229936, now seen corresponding path program 1 times [2025-01-10 02:31:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558569624] [2025-01-10 02:31:22,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:22,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:22,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:31:22,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:31:22,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:22,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:31:22,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:22,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558569624] [2025-01-10 02:31:22,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558569624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:22,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:22,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:31:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471674908] [2025-01-10 02:31:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:22,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:22,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:22,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:22,829 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:22,860 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2025-01-10 02:31:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:31:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 02:31:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:22,861 INFO L225 Difference]: With dead ends: 163 [2025-01-10 02:31:22,861 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 02:31:22,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:31:22,862 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:22,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 02:31:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-01-10 02:31:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:31:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-01-10 02:31:22,871 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-01-10 02:31:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:22,871 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-10 02:31:22,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-01-10 02:31:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 02:31:22,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:22,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:22,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:31:22,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:22,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1177679063, now seen corresponding path program 1 times [2025-01-10 02:31:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:22,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884263129] [2025-01-10 02:31:22,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:22,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 02:31:22,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 02:31:22,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:22,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884263129] [2025-01-10 02:31:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884263129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:22,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092199317] [2025-01-10 02:31:22,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:22,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:22,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:31:22,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 02:31:23,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 02:31:23,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:23,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:23,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:31:23,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:23,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:23,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092199317] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:23,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 02:31:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398232988] [2025-01-10 02:31:23,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:23,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:31:23,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:23,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:31:23,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:31:23,124 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:31:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:23,205 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2025-01-10 02:31:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:31:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-01-10 02:31:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:23,206 INFO L225 Difference]: With dead ends: 65 [2025-01-10 02:31:23,206 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 02:31:23,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:31:23,207 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:23,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 146 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 02:31:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2025-01-10 02:31:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 02:31:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-01-10 02:31:23,212 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 19 [2025-01-10 02:31:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:23,212 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-01-10 02:31:23,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:31:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-01-10 02:31:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:31:23,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:23,213 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:23,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:23,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:23,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:23,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1664379658, now seen corresponding path program 1 times [2025-01-10 02:31:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:23,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926518829] [2025-01-10 02:31:23,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:23,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:31:23,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:31:23,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:23,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 02:31:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926518829] [2025-01-10 02:31:23,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926518829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054872544] [2025-01-10 02:31:23,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:23,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:23,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:23,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:23,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:31:23,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:31:23,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:31:23,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:23,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:31:23,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:31:23,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:31:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054872544] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:23,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-01-10 02:31:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710329590] [2025-01-10 02:31:23,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:23,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:31:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:23,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:31:23,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:31:23,576 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:31:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:23,641 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-01-10 02:31:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:31:23,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-01-10 02:31:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:23,642 INFO L225 Difference]: With dead ends: 70 [2025-01-10 02:31:23,642 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 02:31:23,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:31:23,643 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:23,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 144 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 02:31:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2025-01-10 02:31:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.127659574468085) internal successors, (53), 46 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 02:31:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-01-10 02:31:23,649 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 25 [2025-01-10 02:31:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:23,649 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-01-10 02:31:23,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:31:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-01-10 02:31:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:31:23,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:23,653 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:23,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:23,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:23,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:23,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash 56161900, now seen corresponding path program 1 times [2025-01-10 02:31:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:23,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480381897] [2025-01-10 02:31:23,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:23,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:23,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:31:23,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:31:23,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:31:23,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480381897] [2025-01-10 02:31:23,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480381897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583998307] [2025-01-10 02:31:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:23,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:23,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:31:23,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:31:23,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:31:23,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:23,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:23,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:31:23,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:31:24,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:31:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583998307] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:24,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-01-10 02:31:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344808863] [2025-01-10 02:31:24,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:31:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:24,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:31:24,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:31:24,088 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:31:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:24,218 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2025-01-10 02:31:24,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:31:24,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-01-10 02:31:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:24,219 INFO L225 Difference]: With dead ends: 93 [2025-01-10 02:31:24,219 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 02:31:24,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:31:24,223 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:24,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 101 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 02:31:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-01-10 02:31:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 02:31:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-01-10 02:31:24,230 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 26 [2025-01-10 02:31:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:24,230 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-01-10 02:31:24,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:31:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-01-10 02:31:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:31:24,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:24,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:24,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:31:24,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:31:24,433 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:24,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1495284169, now seen corresponding path program 1 times [2025-01-10 02:31:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:24,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740292714] [2025-01-10 02:31:24,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:24,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:31:24,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:31:24,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:24,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:31:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740292714] [2025-01-10 02:31:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740292714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488121376] [2025-01-10 02:31:24,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:24,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:24,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:24,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:24,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:31:24,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:31:24,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:31:24,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:24,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:24,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:31:24,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:31:24,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:31:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488121376] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:24,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-01-10 02:31:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985822166] [2025-01-10 02:31:24,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 02:31:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:24,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 02:31:24,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:31:24,814 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-10 02:31:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:24,987 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2025-01-10 02:31:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 02:31:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2025-01-10 02:31:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:24,988 INFO L225 Difference]: With dead ends: 91 [2025-01-10 02:31:24,988 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 02:31:24,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:31:24,989 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:24,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 02:31:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2025-01-10 02:31:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 54 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-10 02:31:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-01-10 02:31:24,994 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 30 [2025-01-10 02:31:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:24,994 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-01-10 02:31:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-10 02:31:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-01-10 02:31:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:31:24,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:24,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:25,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:31:25,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:31:25,199 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:25,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1892617292, now seen corresponding path program 1 times [2025-01-10 02:31:25,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97427906] [2025-01-10 02:31:25,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:25,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:31:25,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:31:25,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:25,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:31:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97427906] [2025-01-10 02:31:25,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97427906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103432469] [2025-01-10 02:31:25,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:25,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:25,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:25,294 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:25,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:31:25,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:31:25,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:31:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:25,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:31:25,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:31:25,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 02:31:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103432469] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:25,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2025-01-10 02:31:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372527890] [2025-01-10 02:31:25,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:31:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:25,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:31:25,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:31:25,539 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 19 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 02:31:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:25,853 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2025-01-10 02:31:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 02:31:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 37 [2025-01-10 02:31:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:25,854 INFO L225 Difference]: With dead ends: 137 [2025-01-10 02:31:25,855 INFO L226 Difference]: Without dead ends: 130 [2025-01-10 02:31:25,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 02:31:25,856 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 108 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:25,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 125 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-10 02:31:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 73. [2025-01-10 02:31:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 58 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-10 02:31:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-01-10 02:31:25,867 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 37 [2025-01-10 02:31:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:25,867 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-01-10 02:31:25,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 02:31:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2025-01-10 02:31:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:31:25,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:25,868 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:25,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:26,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 02:31:26,073 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:26,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1668452707, now seen corresponding path program 2 times [2025-01-10 02:31:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:26,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132416531] [2025-01-10 02:31:26,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:31:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:26,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-01-10 02:31:26,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:31:26,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:31:26,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 02:31:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132416531] [2025-01-10 02:31:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132416531] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085570667] [2025-01-10 02:31:26,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:31:26,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:26,335 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:26,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:31:26,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-01-10 02:31:26,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:31:26,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:31:26,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:26,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 02:31:26,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 02:31:26,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 10 proven. 99 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-10 02:31:27,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085570667] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:27,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:27,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2025-01-10 02:31:27,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152129870] [2025-01-10 02:31:27,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:27,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 02:31:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:27,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 02:31:27,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-01-10 02:31:27,182 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-10 02:31:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:27,617 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2025-01-10 02:31:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 02:31:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 64 [2025-01-10 02:31:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:27,619 INFO L225 Difference]: With dead ends: 144 [2025-01-10 02:31:27,619 INFO L226 Difference]: Without dead ends: 143 [2025-01-10 02:31:27,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=348, Invalid=1908, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 02:31:27,621 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:27,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 187 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:31:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-10 02:31:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2025-01-10 02:31:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 74 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (20), 14 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-10 02:31:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2025-01-10 02:31:27,630 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 64 [2025-01-10 02:31:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:27,630 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2025-01-10 02:31:27,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-10 02:31:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2025-01-10 02:31:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:31:27,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:27,631 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:27,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:31:27,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:27,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:27,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash 198328012, now seen corresponding path program 2 times [2025-01-10 02:31:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:27,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040128517] [2025-01-10 02:31:27,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:31:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:27,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 02:31:27,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:31:27,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:31:27,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:31:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040128517] [2025-01-10 02:31:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040128517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015070245] [2025-01-10 02:31:27,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:31:27,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:27,974 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:27,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:31:28,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 02:31:28,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:31:28,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:31:28,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:28,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:31:28,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:31:28,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:31:28,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015070245] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:28,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:28,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 25 [2025-01-10 02:31:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118614271] [2025-01-10 02:31:28,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:28,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 02:31:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:28,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 02:31:28,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:31:28,413 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 26 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-10 02:31:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:28,907 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2025-01-10 02:31:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 02:31:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 48 [2025-01-10 02:31:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:28,909 INFO L225 Difference]: With dead ends: 155 [2025-01-10 02:31:28,909 INFO L226 Difference]: Without dead ends: 145 [2025-01-10 02:31:28,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=1779, Unknown=0, NotChecked=0, Total=2162 [2025-01-10 02:31:28,911 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 91 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:28,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 139 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:31:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-10 02:31:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2025-01-10 02:31:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.0636363636363637) internal successors, (117), 109 states have internal predecessors, (117), 9 states have call successors, (9), 6 states have call predecessors, (9), 17 states have return successors, (27), 21 states have call predecessors, (27), 7 states have call successors, (27) [2025-01-10 02:31:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-01-10 02:31:28,922 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 48 [2025-01-10 02:31:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:28,923 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-01-10 02:31:28,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-10 02:31:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-01-10 02:31:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:31:28,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:28,924 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:28,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:29,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 02:31:29,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:29,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2026872518, now seen corresponding path program 3 times [2025-01-10 02:31:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:29,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645768954] [2025-01-10 02:31:29,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:31:29,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:29,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 8 equivalence classes. [2025-01-10 02:31:29,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 65 of 70 statements. [2025-01-10 02:31:29,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 02:31:29,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 12 proven. 119 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:31:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645768954] [2025-01-10 02:31:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645768954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916466675] [2025-01-10 02:31:29,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:31:29,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:29,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:29,352 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:29,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:31:29,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 8 equivalence classes. [2025-01-10 02:31:29,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 65 of 70 statements. [2025-01-10 02:31:29,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 02:31:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:29,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:31:29,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 58 proven. 57 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-10 02:31:29,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 68 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:31:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916466675] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:30,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:30,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 37 [2025-01-10 02:31:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062190321] [2025-01-10 02:31:30,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:30,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-10 02:31:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:30,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-10 02:31:30,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 02:31:30,230 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 38 states, 37 states have (on average 3.0) internal successors, (111), 35 states have internal predecessors, (111), 12 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (17), 17 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 02:31:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:31,148 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2025-01-10 02:31:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-10 02:31:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 35 states have internal predecessors, (111), 12 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (17), 17 states have call predecessors, (17), 11 states have call successors, (17) Word has length 70 [2025-01-10 02:31:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:31,149 INFO L225 Difference]: With dead ends: 225 [2025-01-10 02:31:31,149 INFO L226 Difference]: Without dead ends: 197 [2025-01-10 02:31:31,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=827, Invalid=5179, Unknown=0, NotChecked=0, Total=6006 [2025-01-10 02:31:31,151 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 262 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:31,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 191 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:31:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-01-10 02:31:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2025-01-10 02:31:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 98 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 17 states have return successors, (26), 20 states have call predecessors, (26), 5 states have call successors, (26) [2025-01-10 02:31:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2025-01-10 02:31:31,174 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 70 [2025-01-10 02:31:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2025-01-10 02:31:31,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 35 states have internal predecessors, (111), 12 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (17), 17 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 02:31:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2025-01-10 02:31:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-10 02:31:31,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:31,176 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:31,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:31,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:31,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:31,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:31,380 INFO L85 PathProgramCache]: Analyzing trace with hash -799864815, now seen corresponding path program 3 times [2025-01-10 02:31:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:31,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577805750] [2025-01-10 02:31:31,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:31:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:31,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-01-10 02:31:31,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-01-10 02:31:31,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:31:31,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 60 proven. 289 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-10 02:31:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577805750] [2025-01-10 02:31:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577805750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216452950] [2025-01-10 02:31:31,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:31:31,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:31,867 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:31,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:31:31,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-01-10 02:31:31,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-01-10 02:31:31,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:31:31,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:31,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 02:31:31,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-10 02:31:32,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 30 proven. 289 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-10 02:31:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216452950] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:35,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:35,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 51 [2025-01-10 02:31:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025092201] [2025-01-10 02:31:35,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:35,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-10 02:31:35,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:35,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-10 02:31:35,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2344, Unknown=0, NotChecked=0, Total=2652 [2025-01-10 02:31:35,529 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 52 states, 51 states have (on average 2.5098039215686274) internal successors, (128), 50 states have internal predecessors, (128), 8 states have call successors, (10), 3 states have call predecessors, (10), 16 states have return successors, (24), 24 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-10 02:31:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:36,473 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2025-01-10 02:31:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-01-10 02:31:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.5098039215686274) internal successors, (128), 50 states have internal predecessors, (128), 8 states have call successors, (10), 3 states have call predecessors, (10), 16 states have return successors, (24), 24 states have call predecessors, (24), 6 states have call successors, (24) Word has length 108 [2025-01-10 02:31:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:36,475 INFO L225 Difference]: With dead ends: 237 [2025-01-10 02:31:36,475 INFO L226 Difference]: Without dead ends: 236 [2025-01-10 02:31:36,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1003, Invalid=7007, Unknown=0, NotChecked=0, Total=8010 [2025-01-10 02:31:36,477 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 185 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:36,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 283 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:31:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-10 02:31:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 163. [2025-01-10 02:31:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 130 states have internal predecessors, (136), 6 states have call successors, (6), 4 states have call predecessors, (6), 25 states have return successors, (42), 28 states have call predecessors, (42), 5 states have call successors, (42) [2025-01-10 02:31:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2025-01-10 02:31:36,492 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 108 [2025-01-10 02:31:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:36,493 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2025-01-10 02:31:36,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.5098039215686274) internal successors, (128), 50 states have internal predecessors, (128), 8 states have call successors, (10), 3 states have call predecessors, (10), 16 states have return successors, (24), 24 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-10 02:31:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2025-01-10 02:31:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-10 02:31:36,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:36,495 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 10, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:36,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:31:36,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:31:36,700 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:36,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 896201684, now seen corresponding path program 4 times [2025-01-10 02:31:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329647553] [2025-01-10 02:31:36,701 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:31:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:36,706 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-01-10 02:31:36,713 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-01-10 02:31:36,714 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:31:36,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 132 proven. 289 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-10 02:31:37,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329647553] [2025-01-10 02:31:37,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329647553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790076933] [2025-01-10 02:31:37,292 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:31:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:37,294 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:37,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:31:37,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-01-10 02:31:37,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-01-10 02:31:37,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:31:37,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:37,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 02:31:37,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 6 proven. 421 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-10 02:31:37,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 36 proven. 423 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-10 02:31:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790076933] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:40,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 26] total 59 [2025-01-10 02:31:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224690621] [2025-01-10 02:31:40,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:40,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-10 02:31:40,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:40,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-10 02:31:40,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3182, Unknown=0, NotChecked=0, Total=3540 [2025-01-10 02:31:40,814 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 57 states have internal predecessors, (164), 13 states have call successors, (18), 4 states have call predecessors, (18), 19 states have return successors, (30), 30 states have call predecessors, (30), 11 states have call successors, (30) [2025-01-10 02:31:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:43,107 INFO L93 Difference]: Finished difference Result 387 states and 439 transitions. [2025-01-10 02:31:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-01-10 02:31:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 57 states have internal predecessors, (164), 13 states have call successors, (18), 4 states have call predecessors, (18), 19 states have return successors, (30), 30 states have call predecessors, (30), 11 states have call successors, (30) Word has length 126 [2025-01-10 02:31:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:43,109 INFO L225 Difference]: With dead ends: 387 [2025-01-10 02:31:43,109 INFO L226 Difference]: Without dead ends: 338 [2025-01-10 02:31:43,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7040 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2579, Invalid=20373, Unknown=0, NotChecked=0, Total=22952 [2025-01-10 02:31:43,114 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 452 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:43,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 474 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 02:31:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-01-10 02:31:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 203. [2025-01-10 02:31:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.030674846625767) internal successors, (168), 162 states have internal predecessors, (168), 6 states have call successors, (6), 4 states have call predecessors, (6), 33 states have return successors, (50), 36 states have call predecessors, (50), 5 states have call successors, (50) [2025-01-10 02:31:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2025-01-10 02:31:43,129 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 126 [2025-01-10 02:31:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:43,130 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2025-01-10 02:31:43,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 57 states have internal predecessors, (164), 13 states have call successors, (18), 4 states have call predecessors, (18), 19 states have return successors, (30), 30 states have call predecessors, (30), 11 states have call successors, (30) [2025-01-10 02:31:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2025-01-10 02:31:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-10 02:31:43,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:43,131 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:43,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:31:43,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:31:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1987508985, now seen corresponding path program 4 times [2025-01-10 02:31:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:43,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443954106] [2025-01-10 02:31:43,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:31:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:43,343 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 196 statements into 2 equivalence classes. [2025-01-10 02:31:43,381 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-01-10 02:31:43,381 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:31:43,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-01-10 02:31:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443954106] [2025-01-10 02:31:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443954106] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600979752] [2025-01-10 02:31:44,877 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:31:44,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:44,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:44,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:44,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:31:44,975 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 196 statements into 2 equivalence classes. [2025-01-10 02:31:45,009 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-01-10 02:31:45,009 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:31:45,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:45,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-10 02:31:45,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-01-10 02:31:45,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 70 proven. 909 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2025-01-10 02:32:15,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600979752] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:15,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:15,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 38] total 90 [2025-01-10 02:32:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602120665] [2025-01-10 02:32:15,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-01-10 02:32:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:15,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-01-10 02:32:15,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=7256, Unknown=0, NotChecked=0, Total=8190 [2025-01-10 02:32:15,511 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 91 states, 90 states have (on average 2.3777777777777778) internal successors, (214), 89 states have internal predecessors, (214), 8 states have call successors, (10), 3 states have call predecessors, (10), 31 states have return successors, (48), 48 states have call predecessors, (48), 6 states have call successors, (48) [2025-01-10 02:32:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:17,655 INFO L93 Difference]: Finished difference Result 437 states and 505 transitions. [2025-01-10 02:32:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-01-10 02:32:17,656 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 2.3777777777777778) internal successors, (214), 89 states have internal predecessors, (214), 8 states have call successors, (10), 3 states have call predecessors, (10), 31 states have return successors, (48), 48 states have call predecessors, (48), 6 states have call successors, (48) Word has length 196 [2025-01-10 02:32:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:17,658 INFO L225 Difference]: With dead ends: 437 [2025-01-10 02:32:17,658 INFO L226 Difference]: Without dead ends: 436 [2025-01-10 02:32:17,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7172 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2928, Invalid=20942, Unknown=0, NotChecked=0, Total=23870 [2025-01-10 02:32:17,660 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 478 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:17,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 632 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:32:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-10 02:32:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 283. [2025-01-10 02:32:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 227 states have (on average 1.0220264317180616) internal successors, (232), 226 states have internal predecessors, (232), 6 states have call successors, (6), 4 states have call predecessors, (6), 49 states have return successors, (82), 52 states have call predecessors, (82), 5 states have call successors, (82) [2025-01-10 02:32:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 320 transitions. [2025-01-10 02:32:17,678 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 320 transitions. Word has length 196 [2025-01-10 02:32:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:17,678 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 320 transitions. [2025-01-10 02:32:17,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 2.3777777777777778) internal successors, (214), 89 states have internal predecessors, (214), 8 states have call successors, (10), 3 states have call predecessors, (10), 31 states have return successors, (48), 48 states have call predecessors, (48), 6 states have call successors, (48) [2025-01-10 02:32:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 320 transitions. [2025-01-10 02:32:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-10 02:32:17,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:17,680 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 19, 19, 19, 19, 18, 17, 17, 17, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:17,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 02:32:17,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:17,881 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:32:17,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash 827389372, now seen corresponding path program 5 times [2025-01-10 02:32:17,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:17,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395287841] [2025-01-10 02:32:17,881 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:32:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:17,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 214 statements into 21 equivalence classes. [2025-01-10 02:32:17,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 214 of 214 statements. [2025-01-10 02:32:17,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-01-10 02:32:17,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1857 backedges. 6 proven. 1153 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-01-10 02:32:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395287841] [2025-01-10 02:32:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395287841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910616013] [2025-01-10 02:32:19,219 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:32:19,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:19,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:19,220 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:32:19,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 02:32:19,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 214 statements into 21 equivalence classes. [2025-01-10 02:32:19,589 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 214 of 214 statements. [2025-01-10 02:32:19,589 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-01-10 02:32:19,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:19,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-10 02:32:19,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1857 backedges. 6 proven. 1153 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-01-10 02:32:20,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1857 backedges. 76 proven. 1155 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2025-01-10 02:32:49,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910616013] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:49,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 42] total 96 [2025-01-10 02:32:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569690049] [2025-01-10 02:32:49,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-01-10 02:32:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:49,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-01-10 02:32:49,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=8357, Unknown=0, NotChecked=0, Total=9312 [2025-01-10 02:32:49,639 INFO L87 Difference]: Start difference. First operand 283 states and 320 transitions. Second operand has 97 states, 96 states have (on average 2.46875) internal successors, (237), 95 states have internal predecessors, (237), 11 states have call successors, (13), 3 states have call predecessors, (13), 34 states have return successors, (52), 52 states have call predecessors, (52), 9 states have call successors, (52)