./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/b.09-no-inv_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/termination-memory-alloca/b.09-no-inv_assume-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:23:51,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:23:51,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-04-30 10:23:51,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:23:51,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:23:51,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:23:51,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:23:51,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:23:51,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:23:51,851 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:23:51,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:23:51,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:23:51,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:23:51,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:23:51,852 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:23:51,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:23:51,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:23:51,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:23:51,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:23:51,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:23:51,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:23:51,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:23:51,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:23:51,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:23:51,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:23:51,855 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b [2025-04-30 10:23:52,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:23:52,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:23:52,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:23:52,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:23:52,116 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:23:52,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2025-04-30 10:23:53,447 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6e6ecfc/e68eb7ab814c4c32a2b1cf4fa7277bf4/FLAG19c709e3b [2025-04-30 10:23:53,708 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:23:53,709 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2025-04-30 10:23:53,717 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6e6ecfc/e68eb7ab814c4c32a2b1cf4fa7277bf4/FLAG19c709e3b [2025-04-30 10:23:54,498 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6e6ecfc/e68eb7ab814c4c32a2b1cf4fa7277bf4 [2025-04-30 10:23:54,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:23:54,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:23:54,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:23:54,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:23:54,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:23:54,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457b8fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54, skipping insertion in model container [2025-04-30 10:23:54,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:23:54,727 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:23:54,733 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:23:54,786 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:23:54,802 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:23:54,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54 WrapperNode [2025-04-30 10:23:54,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:23:54,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:23:54,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:23:54,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:23:54,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,829 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2025-04-30 10:23:54,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:23:54,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:23:54,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:23:54,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:23:54,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,853 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [7, 4, 4]. 47 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [3, 1, 2]. [2025-04-30 10:23:54,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:23:54,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:23:54,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:23:54,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:23:54,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:23:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:54,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:23:54,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:23:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:23:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:23:54,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:23:54,977 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:23:54,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:23:55,080 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-04-30 10:23:55,080 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:23:55,086 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:23:55,086 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:23:55,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:23:55 BoogieIcfgContainer [2025-04-30 10:23:55,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:23:55,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:23:55,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:23:55,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:23:55,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:23:54" (1/3) ... [2025-04-30 10:23:55,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff28125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:23:55, skipping insertion in model container [2025-04-30 10:23:55,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (2/3) ... [2025-04-30 10:23:55,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff28125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:23:55, skipping insertion in model container [2025-04-30 10:23:55,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:23:55" (3/3) ... [2025-04-30 10:23:55,096 INFO L128 eAbstractionObserver]: Analyzing ICFG b.09-no-inv_assume-alloca.i [2025-04-30 10:23:55,106 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:23:55,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.09-no-inv_assume-alloca.i that has 1 procedures, 22 locations, 26 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-30 10:23:55,148 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:23:55,156 INFO L340 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;@6e64d6e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:23:55,156 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-30 10:23:55,163 INFO L278 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:23:55,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,168 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:55,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -474810389, now seen corresponding path program 1 times [2025-04-30 10:23:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561553469] [2025-04-30 10:23:55,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:23:55,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:23:55,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:55,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561553469] [2025-04-30 10:23:55,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561553469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:55,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:55,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:23:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858153552] [2025-04-30 10:23:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:55,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:23:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:55,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:23:55,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:23:55,371 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,397 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-04-30 10:23:55,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:23:55,400 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:23:55,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,403 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:23:55,403 INFO L226 Difference]: Without dead ends: 17 [2025-04-30 10:23:55,405 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:23:55,409 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-30 10:23:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-30 10:23:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-04-30 10:23:55,430 INFO L79 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2025-04-30 10:23:55,430 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,430 INFO L485 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-04-30 10:23:55,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,430 INFO L278 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-04-30 10:23:55,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:23:55,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:23:55,431 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:55,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1300196973, now seen corresponding path program 1 times [2025-04-30 10:23:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280746783] [2025-04-30 10:23:55,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:23:55,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:23:55,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:55,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280746783] [2025-04-30 10:23:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280746783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:55,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:23:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398921827] [2025-04-30 10:23:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:55,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:23:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:55,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:23:55,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:55,732 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,771 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-04-30 10:23:55,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:23:55,772 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:23:55,772 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,773 INFO L225 Difference]: With dead ends: 25 [2025-04-30 10:23:55,773 INFO L226 Difference]: Without dead ends: 24 [2025-04-30 10:23:55,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:23:55,775 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,775 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 28 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-30 10:23:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-04-30 10:23:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-04-30 10:23:55,779 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2025-04-30 10:23:55,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,779 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-04-30 10:23:55,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,779 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-04-30 10:23:55,780 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:23:55,780 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:23:55,780 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:55,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1651398768, now seen corresponding path program 1 times [2025-04-30 10:23:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668337922] [2025-04-30 10:23:55,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:23:55,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:23:55,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:55,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668337922] [2025-04-30 10:23:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668337922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:23:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198649738] [2025-04-30 10:23:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:55,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:23:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:55,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:23:55,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:23:55,905 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,931 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-04-30 10:23:55,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:55,932 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:23:55,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,932 INFO L225 Difference]: With dead ends: 29 [2025-04-30 10:23:55,933 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:23:55,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:55,934 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:23:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-04-30 10:23:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-04-30 10:23:55,938 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2025-04-30 10:23:55,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,939 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-04-30 10:23:55,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,939 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-04-30 10:23:55,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:23:55,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:23:55,940 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:55,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1651400562, now seen corresponding path program 1 times [2025-04-30 10:23:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617069412] [2025-04-30 10:23:55,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:23:55,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:23:55,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:56,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617069412] [2025-04-30 10:23:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617069412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:23:56,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480969909] [2025-04-30 10:23:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:56,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:23:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:56,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:23:56,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:23:56,057 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:56,095 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-04-30 10:23:56,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:56,096 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:23:56,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:56,096 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:23:56,096 INFO L226 Difference]: Without dead ends: 41 [2025-04-30 10:23:56,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:56,097 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:56,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-30 10:23:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-04-30 10:23:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-04-30 10:23:56,103 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 10 [2025-04-30 10:23:56,103 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:56,103 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-04-30 10:23:56,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,103 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-04-30 10:23:56,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:23:56,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:56,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:56,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:23:56,105 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:56,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash 426935456, now seen corresponding path program 1 times [2025-04-30 10:23:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:56,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061565800] [2025-04-30 10:23:56,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:56,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:23:56,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:23:56,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:56,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:56,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061565800] [2025-04-30 10:23:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061565800] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:56,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935139388] [2025-04-30 10:23:56,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:56,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:56,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:56,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:23:56,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:23:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:23:56,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:56,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:56,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:23:56,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:56,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:23:56,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:23:56,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935139388] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:56,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:56,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:23:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594134222] [2025-04-30 10:23:56,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:56,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:23:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:56,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:23:56,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:23:56,555 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:56,636 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-04-30 10:23:56,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:23:56,636 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:23:56,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:56,637 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:23:56,637 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:23:56,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:23:56,638 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:56,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 50 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:23:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-04-30 10:23:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-04-30 10:23:56,641 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-04-30 10:23:56,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:56,642 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-04-30 10:23:56,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,642 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-04-30 10:23:56,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:23:56,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:56,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:56,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:23:56,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:56,843 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:56,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash 350095517, now seen corresponding path program 1 times [2025-04-30 10:23:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:56,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832394477] [2025-04-30 10:23:56,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:56,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:23:56,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:23:56,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:56,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:56,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832394477] [2025-04-30 10:23:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832394477] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:56,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267211676] [2025-04-30 10:23:56,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:56,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:56,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:56,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:23:57,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:23:57,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:23:57,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:57,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:57,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:23:57,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:57,055 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:23:57,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:23:57,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:57,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:23:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267211676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:23:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-30 10:23:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169641833] [2025-04-30 10:23:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:57,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:23:57,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:57,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:23:57,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:23:57,096 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:57,130 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2025-04-30 10:23:57,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:57,131 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:23:57,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:57,132 INFO L225 Difference]: With dead ends: 78 [2025-04-30 10:23:57,133 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:23:57,133 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:23:57,133 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:57,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:23:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-04-30 10:23:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-04-30 10:23:57,140 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 17 [2025-04-30 10:23:57,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:57,140 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-04-30 10:23:57,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,140 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-04-30 10:23:57,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:23:57,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:57,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:57,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:23:57,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:23:57,346 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:57,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash 350097311, now seen corresponding path program 1 times [2025-04-30 10:23:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:57,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344229004] [2025-04-30 10:23:57,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:57,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:23:57,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:23:57,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:57,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:57,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:57,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344229004] [2025-04-30 10:23:57,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344229004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:57,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988251027] [2025-04-30 10:23:57,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:57,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:57,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:23:57,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:23:57,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:23:57,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:57,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:57,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:23:57,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:57,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:23:57,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:57,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:23:57,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:57,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:23:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:23:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988251027] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:57,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-30 10:23:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688112261] [2025-04-30 10:23:57,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:57,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:23:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:57,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:23:57,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:23:57,651 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:57,696 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-04-30 10:23:57,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:23:57,696 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:23:57,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:57,697 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:23:57,697 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:23:57,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:23:57,698 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 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-04-30 10:23:57,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:23:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-30 10:23:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-04-30 10:23:57,701 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 17 [2025-04-30 10:23:57,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:57,701 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-04-30 10:23:57,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,702 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-04-30 10:23:57,702 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:23:57,702 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:57,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:57,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:23:57,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:57,905 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:57,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 821228612, now seen corresponding path program 1 times [2025-04-30 10:23:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:57,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656979769] [2025-04-30 10:23:57,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:57,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:23:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:23:57,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:57,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:58,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:58,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656979769] [2025-04-30 10:23:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656979769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:58,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194688570] [2025-04-30 10:23:58,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:58,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:58,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:58,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:58,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:23:58,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:23:58,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:23:58,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:58,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:58,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:23:58,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:58,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:23:58,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:58,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:58,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194688570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:58,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:58,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-30 10:23:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022315779] [2025-04-30 10:23:58,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:58,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:23:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:58,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:23:58,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:23:58,284 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:58,375 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-04-30 10:23:58,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:23:58,375 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:23:58,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:58,376 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:23:58,376 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:23:58,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:23:58,376 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:58,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:23:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:23:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2025-04-30 10:23:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 57 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-04-30 10:23:58,384 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 18 [2025-04-30 10:23:58,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:58,384 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-04-30 10:23:58,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:58,384 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-04-30 10:23:58,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:23:58,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:58,385 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:58,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:23:58,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:58,589 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:58,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1436068865, now seen corresponding path program 1 times [2025-04-30 10:23:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:58,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458417031] [2025-04-30 10:23:58,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:58,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:23:58,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:23:58,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:58,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:58,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458417031] [2025-04-30 10:23:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458417031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:58,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249556885] [2025-04-30 10:23:58,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:58,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:58,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:58,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:23:58,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:23:58,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:23:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:58,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:58,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:23:58,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:58,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:23:58,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:23:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:58,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:23:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249556885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:58,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:23:58,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-30 10:23:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247262226] [2025-04-30 10:23:58,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:58,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:23:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:58,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:23:58,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:23:58,832 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:58,852 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-04-30 10:23:58,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:58,853 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-30 10:23:58,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:58,853 INFO L225 Difference]: With dead ends: 58 [2025-04-30 10:23:58,854 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:23:58,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:23:58,854 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:58,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:23:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-30 10:23:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-04-30 10:23:58,858 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 19 [2025-04-30 10:23:58,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:58,858 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-04-30 10:23:58,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:58,858 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-04-30 10:23:58,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:23:58,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:58,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:58,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:23:59,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:59,062 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:59,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1568461924, now seen corresponding path program 1 times [2025-04-30 10:23:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:59,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031635668] [2025-04-30 10:23:59,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:59,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:23:59,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:23:59,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:59,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:59,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031635668] [2025-04-30 10:23:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031635668] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:59,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117753065] [2025-04-30 10:23:59,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:59,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:59,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:59,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:59,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:23:59,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:23:59,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:23:59,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:59,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:59,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:23:59,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:59,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:23:59,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:23:59,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:59,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117753065] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:59,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-30 10:23:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240644832] [2025-04-30 10:23:59,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:59,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:23:59,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:59,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:23:59,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:23:59,362 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:59,419 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2025-04-30 10:23:59,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:23:59,420 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:23:59,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:59,420 INFO L225 Difference]: With dead ends: 118 [2025-04-30 10:23:59,420 INFO L226 Difference]: Without dead ends: 117 [2025-04-30 10:23:59,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:23:59,421 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:59,421 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-30 10:23:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-04-30 10:23:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-04-30 10:23:59,434 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 20 [2025-04-30 10:23:59,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:59,435 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-04-30 10:23:59,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:59,435 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-04-30 10:23:59,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:23:59,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:59,436 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:59,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:23:59,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:59,636 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:23:59,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1121853376, now seen corresponding path program 1 times [2025-04-30 10:23:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:59,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443279270] [2025-04-30 10:23:59,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:59,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:23:59,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:23:59,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:59,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:59,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443279270] [2025-04-30 10:23:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443279270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:59,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968119199] [2025-04-30 10:23:59,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:59,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:59,908 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:59,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:23:59,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:23:59,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:23:59,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:59,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:59,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:23:59,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:59,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:23:59,999 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:00,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:00,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968119199] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:00,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:00,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-04-30 10:24:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804085027] [2025-04-30 10:24:00,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:00,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:24:00,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:00,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:24:00,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:24:00,211 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:00,443 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2025-04-30 10:24:00,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:24:00,443 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-30 10:24:00,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:00,444 INFO L225 Difference]: With dead ends: 178 [2025-04-30 10:24:00,444 INFO L226 Difference]: Without dead ends: 177 [2025-04-30 10:24:00,445 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:24:00,445 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:00,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 95 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-30 10:24:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2025-04-30 10:24:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.125) internal successors, (189), 169 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 189 transitions. [2025-04-30 10:24:00,458 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 189 transitions. Word has length 34 [2025-04-30 10:24:00,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:00,458 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 189 transitions. [2025-04-30 10:24:00,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:00,458 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 189 transitions. [2025-04-30 10:24:00,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:24:00,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:00,459 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:24:00,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:24:00,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:00,660 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:00,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1792359901, now seen corresponding path program 2 times [2025-04-30 10:24:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:00,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337179795] [2025-04-30 10:24:00,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:24:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:00,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:24:00,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:24:00,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:24:00,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:24:00,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:00,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337179795] [2025-04-30 10:24:00,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337179795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:00,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9375883] [2025-04-30 10:24:00,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:24:00,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:00,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:00,861 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:00,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:24:00,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:24:00,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:24:00,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:24:00,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:00,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:24:00,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:00,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:01,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2025-04-30 10:24:01,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-04-30 10:24:01,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:24:01,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:24:01,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9375883] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:01,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-30 10:24:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702332407] [2025-04-30 10:24:01,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:01,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:24:01,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:01,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:24:01,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:24:01,095 INFO L87 Difference]: Start difference. First operand 170 states and 189 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:01,174 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2025-04-30 10:24:01,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:24:01,174 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-30 10:24:01,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:01,175 INFO L225 Difference]: With dead ends: 204 [2025-04-30 10:24:01,175 INFO L226 Difference]: Without dead ends: 104 [2025-04-30 10:24:01,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:24:01,176 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:01,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-30 10:24:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-30 10:24:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 103 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2025-04-30 10:24:01,186 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 43 [2025-04-30 10:24:01,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:01,186 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2025-04-30 10:24:01,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:01,186 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2025-04-30 10:24:01,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:24:01,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:01,187 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-04-30 10:24:01,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:24:01,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:24:01,388 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:01,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2131363283, now seen corresponding path program 2 times [2025-04-30 10:24:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:01,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525599407] [2025-04-30 10:24:01,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:24:01,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:01,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:24:01,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:24:01,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:24:01,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:01,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525599407] [2025-04-30 10:24:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525599407] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:01,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500543312] [2025-04-30 10:24:01,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:24:01,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:01,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:01,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:01,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:24:01,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:24:01,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:24:01,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:24:01,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:01,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:24:01,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:01,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:01,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:01,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:01,999 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:02,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:02,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500543312] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:02,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:02,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 31 [2025-04-30 10:24:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805587823] [2025-04-30 10:24:02,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:02,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:24:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:02,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:24:02,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=714, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:24:02,223 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand has 32 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 32 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:02,427 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2025-04-30 10:24:02,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:24:02,428 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 32 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-30 10:24:02,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:02,429 INFO L225 Difference]: With dead ends: 161 [2025-04-30 10:24:02,429 INFO L226 Difference]: Without dead ends: 160 [2025-04-30 10:24:02,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2025-04-30 10:24:02,430 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:02,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 145 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-30 10:24:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2025-04-30 10:24:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 129 states have (on average 1.062015503875969) internal successors, (137), 130 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2025-04-30 10:24:02,435 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 45 [2025-04-30 10:24:02,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:02,435 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2025-04-30 10:24:02,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 32 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:02,436 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2025-04-30 10:24:02,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:24:02,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:02,436 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:02,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:24:02,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:24:02,637 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:02,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1595531371, now seen corresponding path program 3 times [2025-04-30 10:24:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:02,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828269312] [2025-04-30 10:24:02,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:24:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:02,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 5 equivalence classes. [2025-04-30 10:24:02,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:24:02,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:24:02,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:02,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828269312] [2025-04-30 10:24:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828269312] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:02,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121764216] [2025-04-30 10:24:02,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:24:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:02,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:02,898 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:02,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:24:02,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 5 equivalence classes. [2025-04-30 10:24:03,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:24:03,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:24:03,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:03,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:24:03,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:03,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:03,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:03,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:03,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:03,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:03,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:24:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:03,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:03,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121764216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:03,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:03,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-30 10:24:03,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619526115] [2025-04-30 10:24:03,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:03,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:24:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:03,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:24:03,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:24:03,292 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand has 27 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:03,423 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2025-04-30 10:24:03,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:24:03,423 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-30 10:24:03,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:03,425 INFO L225 Difference]: With dead ends: 189 [2025-04-30 10:24:03,425 INFO L226 Difference]: Without dead ends: 188 [2025-04-30 10:24:03,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=350, Invalid=772, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:24:03,426 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:03,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 109 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:24:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-30 10:24:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2025-04-30 10:24:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 1.0327868852459017) internal successors, (189), 184 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2025-04-30 10:24:03,432 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 47 [2025-04-30 10:24:03,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:03,432 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2025-04-30 10:24:03,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:03,433 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2025-04-30 10:24:03,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-30 10:24:03,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:03,434 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:03,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:24:03,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:24:03,635 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:03,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 133807616, now seen corresponding path program 2 times [2025-04-30 10:24:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:03,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68658783] [2025-04-30 10:24:03,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:24:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:03,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-04-30 10:24:03,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:24:03,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:24:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:04,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68658783] [2025-04-30 10:24:04,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68658783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:04,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411891155] [2025-04-30 10:24:04,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:24:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:04,284 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:04,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:24:04,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-04-30 10:24:04,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:24:04,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:24:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:04,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:24:04,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:04,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:24:04,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:04,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:04,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:04,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:04,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:04,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:04,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:04,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:04,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:04,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411891155] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:04,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 45 [2025-04-30 10:24:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824011036] [2025-04-30 10:24:04,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:04,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:24:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:04,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:24:05,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=1558, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:24:05,000 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand has 46 states, 45 states have (on average 3.6222222222222222) internal successors, (163), 46 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:05,578 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2025-04-30 10:24:05,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-30 10:24:05,579 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.6222222222222222) internal successors, (163), 46 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-04-30 10:24:05,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:05,580 INFO L225 Difference]: With dead ends: 236 [2025-04-30 10:24:05,580 INFO L226 Difference]: Without dead ends: 235 [2025-04-30 10:24:05,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1563, Invalid=5079, Unknown=0, NotChecked=0, Total=6642 [2025-04-30 10:24:05,583 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:05,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-30 10:24:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2025-04-30 10:24:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 228 states have (on average 1.030701754385965) internal successors, (235), 229 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 235 transitions. [2025-04-30 10:24:05,591 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 235 transitions. Word has length 70 [2025-04-30 10:24:05,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:05,591 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 235 transitions. [2025-04-30 10:24:05,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.6222222222222222) internal successors, (163), 46 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:05,592 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 235 transitions. [2025-04-30 10:24:05,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-04-30 10:24:05,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:05,593 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-04-30 10:24:05,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:24:05,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:24:05,793 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:05,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash 497444813, now seen corresponding path program 3 times [2025-04-30 10:24:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:05,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344250631] [2025-04-30 10:24:05,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:24:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:05,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 11 equivalence classes. [2025-04-30 10:24:05,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 99 of 99 statements. [2025-04-30 10:24:05,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:24:05,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:06,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344250631] [2025-04-30 10:24:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344250631] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:06,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092035933] [2025-04-30 10:24:06,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:24:06,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:06,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:06,772 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:06,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:24:06,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 11 equivalence classes. [2025-04-30 10:24:07,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 99 of 99 statements. [2025-04-30 10:24:07,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:24:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:07,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:24:07,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:07,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:07,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:07,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,260 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,440 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:07,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:07,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:07,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092035933] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:07,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:07,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 24, 24] total 65 [2025-04-30 10:24:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411396818] [2025-04-30 10:24:07,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:07,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-30 10:24:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:07,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-30 10:24:07,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=3114, Unknown=0, NotChecked=0, Total=4290 [2025-04-30 10:24:07,974 INFO L87 Difference]: Start difference. First operand 230 states and 235 transitions. Second operand has 66 states, 65 states have (on average 3.6307692307692307) internal successors, (236), 66 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:08,393 INFO L93 Difference]: Finished difference Result 347 states and 363 transitions. [2025-04-30 10:24:08,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-30 10:24:08,393 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.6307692307692307) internal successors, (236), 66 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-04-30 10:24:08,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:08,395 INFO L225 Difference]: With dead ends: 347 [2025-04-30 10:24:08,395 INFO L226 Difference]: Without dead ends: 346 [2025-04-30 10:24:08,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2656 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1639, Invalid=4841, Unknown=0, NotChecked=0, Total=6480 [2025-04-30 10:24:08,396 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 91 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:08,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 202 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-30 10:24:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 293. [2025-04-30 10:24:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 291 states have (on average 1.0481099656357389) internal successors, (305), 292 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 305 transitions. [2025-04-30 10:24:08,409 INFO L79 Accepts]: Start accepts. Automaton has 293 states and 305 transitions. Word has length 99 [2025-04-30 10:24:08,409 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:08,409 INFO L485 AbstractCegarLoop]: Abstraction has 293 states and 305 transitions. [2025-04-30 10:24:08,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.6307692307692307) internal successors, (236), 66 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:08,410 INFO L278 IsEmpty]: Start isEmpty. Operand 293 states and 305 transitions. [2025-04-30 10:24:08,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-04-30 10:24:08,410 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:08,410 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:08,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:24:08,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:24:08,611 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:08,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1909439029, now seen corresponding path program 4 times [2025-04-30 10:24:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:08,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000009930] [2025-04-30 10:24:08,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:08,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 101 statements into 2 equivalence classes. [2025-04-30 10:24:08,644 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 101 of 101 statements. [2025-04-30 10:24:08,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:08,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:09,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:09,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000009930] [2025-04-30 10:24:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000009930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:09,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789644451] [2025-04-30 10:24:09,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:09,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:09,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:24:09,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 101 statements into 2 equivalence classes. [2025-04-30 10:24:09,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 101 of 101 statements. [2025-04-30 10:24:09,375 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:09,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:24:09,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:09,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:09,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,631 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:09,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:24:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:09,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:10,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789644451] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:10,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:10,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 56 [2025-04-30 10:24:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213028953] [2025-04-30 10:24:10,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:10,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-30 10:24:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:10,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-30 10:24:10,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=2203, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:24:10,085 INFO L87 Difference]: Start difference. First operand 293 states and 305 transitions. Second operand has 57 states, 56 states have (on average 4.25) internal successors, (238), 57 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:10,362 INFO L93 Difference]: Finished difference Result 409 states and 432 transitions. [2025-04-30 10:24:10,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-30 10:24:10,363 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 4.25) internal successors, (238), 57 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-04-30 10:24:10,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:10,364 INFO L225 Difference]: With dead ends: 409 [2025-04-30 10:24:10,364 INFO L226 Difference]: Without dead ends: 408 [2025-04-30 10:24:10,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1424, Invalid=3406, Unknown=0, NotChecked=0, Total=4830 [2025-04-30 10:24:10,365 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:10,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 219 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-04-30 10:24:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 401. [2025-04-30 10:24:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 399 states have (on average 1.0250626566416041) internal successors, (409), 400 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 409 transitions. [2025-04-30 10:24:10,377 INFO L79 Accepts]: Start accepts. Automaton has 401 states and 409 transitions. Word has length 101 [2025-04-30 10:24:10,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:10,377 INFO L485 AbstractCegarLoop]: Abstraction has 401 states and 409 transitions. [2025-04-30 10:24:10,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 4.25) internal successors, (238), 57 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:10,377 INFO L278 IsEmpty]: Start isEmpty. Operand 401 states and 409 transitions. [2025-04-30 10:24:10,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-04-30 10:24:10,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:10,378 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:10,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-30 10:24:10,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:24:10,578 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:10,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1471847040, now seen corresponding path program 3 times [2025-04-30 10:24:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:10,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828655180] [2025-04-30 10:24:10,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:24:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:10,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 142 statements into 16 equivalence classes. [2025-04-30 10:24:10,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 142 of 142 statements. [2025-04-30 10:24:10,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-04-30 10:24:10,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 0 proven. 991 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:12,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828655180] [2025-04-30 10:24:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828655180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:12,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849721214] [2025-04-30 10:24:12,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:24:12,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:12,231 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:24:12,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 142 statements into 16 equivalence classes. [2025-04-30 10:24:13,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 142 of 142 statements. [2025-04-30 10:24:13,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-04-30 10:24:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:13,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-30 10:24:13,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:13,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:24:13,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:13,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:13,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:13,408 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:13,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 0 proven. 991 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:13,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 0 proven. 991 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849721214] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:14,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:14,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 33, 33] total 90 [2025-04-30 10:24:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420605462] [2025-04-30 10:24:14,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:14,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-04-30 10:24:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:14,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-04-30 10:24:14,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2101, Invalid=6089, Unknown=0, NotChecked=0, Total=8190 [2025-04-30 10:24:14,577 INFO L87 Difference]: Start difference. First operand 401 states and 409 transitions. Second operand has 91 states, 90 states have (on average 3.7333333333333334) internal successors, (336), 91 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:16,208 INFO L93 Difference]: Finished difference Result 492 states and 508 transitions. [2025-04-30 10:24:16,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-30 10:24:16,208 INFO L79 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 3.7333333333333334) internal successors, (336), 91 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-04-30 10:24:16,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:16,210 INFO L225 Difference]: With dead ends: 492 [2025-04-30 10:24:16,210 INFO L226 Difference]: Without dead ends: 491 [2025-04-30 10:24:16,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10233 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=6316, Invalid=21406, Unknown=0, NotChecked=0, Total=27722 [2025-04-30 10:24:16,215 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 115 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:16,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 262 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:24:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-30 10:24:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 482. [2025-04-30 10:24:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 480 states have (on average 1.0229166666666667) internal successors, (491), 481 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 491 transitions. [2025-04-30 10:24:16,230 INFO L79 Accepts]: Start accepts. Automaton has 482 states and 491 transitions. Word has length 142 [2025-04-30 10:24:16,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:16,230 INFO L485 AbstractCegarLoop]: Abstraction has 482 states and 491 transitions. [2025-04-30 10:24:16,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 3.7333333333333334) internal successors, (336), 91 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:16,231 INFO L278 IsEmpty]: Start isEmpty. Operand 482 states and 491 transitions. [2025-04-30 10:24:16,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-04-30 10:24:16,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:16,232 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2025-04-30 10:24:16,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-30 10:24:16,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:16,432 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:16,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash -996812019, now seen corresponding path program 4 times [2025-04-30 10:24:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:16,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711009192] [2025-04-30 10:24:16,433 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:16,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:16,449 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-04-30 10:24:16,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-04-30 10:24:16,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:16,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:19,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711009192] [2025-04-30 10:24:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711009192] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:19,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180205982] [2025-04-30 10:24:19,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:19,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:19,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:19,456 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:19,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:24:19,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-04-30 10:24:19,596 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-04-30 10:24:19,596 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:19,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:19,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-30 10:24:19,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:19,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:19,669 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:19,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,720 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,967 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:19,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:20,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:20,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180205982] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:21,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 48, 48] total 140 [2025-04-30 10:24:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337924281] [2025-04-30 10:24:21,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:21,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2025-04-30 10:24:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2025-04-30 10:24:21,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5273, Invalid=14467, Unknown=0, NotChecked=0, Total=19740 [2025-04-30 10:24:21,930 INFO L87 Difference]: Start difference. First operand 482 states and 491 transitions. Second operand has 141 states, 140 states have (on average 3.592857142857143) internal successors, (503), 141 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:23,116 INFO L93 Difference]: Finished difference Result 719 states and 751 transitions. [2025-04-30 10:24:23,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-04-30 10:24:23,117 INFO L79 Accepts]: Start accepts. Automaton has has 141 states, 140 states have (on average 3.592857142857143) internal successors, (503), 141 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-04-30 10:24:23,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:23,119 INFO L225 Difference]: With dead ends: 719 [2025-04-30 10:24:23,119 INFO L226 Difference]: Without dead ends: 718 [2025-04-30 10:24:23,121 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12974 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6727, Invalid=20333, Unknown=0, NotChecked=0, Total=27060 [2025-04-30 10:24:23,121 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 194 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:23,122 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 312 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:24:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-04-30 10:24:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 617. [2025-04-30 10:24:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 615 states have (on average 1.0422764227642276) internal successors, (641), 616 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 641 transitions. [2025-04-30 10:24:23,138 INFO L79 Accepts]: Start accepts. Automaton has 617 states and 641 transitions. Word has length 207 [2025-04-30 10:24:23,138 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:23,138 INFO L485 AbstractCegarLoop]: Abstraction has 617 states and 641 transitions. [2025-04-30 10:24:23,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 140 states have (on average 3.592857142857143) internal successors, (503), 141 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:23,139 INFO L278 IsEmpty]: Start isEmpty. Operand 617 states and 641 transitions. [2025-04-30 10:24:23,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-04-30 10:24:23,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:23,140 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:23,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:24:23,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:23,341 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:23,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2083932021, now seen corresponding path program 5 times [2025-04-30 10:24:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:23,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315972407] [2025-04-30 10:24:23,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:24:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:23,357 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 209 statements into 23 equivalence classes. [2025-04-30 10:24:23,426 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 209 of 209 statements. [2025-04-30 10:24:23,427 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-04-30 10:24:23,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:25,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315972407] [2025-04-30 10:24:25,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315972407] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:25,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016151119] [2025-04-30 10:24:25,360 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:24:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:25,361 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:25,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:24:25,475 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 209 statements into 23 equivalence classes. [2025-04-30 10:24:31,738 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 209 of 209 statements. [2025-04-30 10:24:31,738 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-04-30 10:24:31,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:31,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-30 10:24:31,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:31,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:31,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,858 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:31,981 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,133 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,340 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:32,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:24:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:32,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016151119] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:33,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:33,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 116 [2025-04-30 10:24:33,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505792691] [2025-04-30 10:24:33,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:33,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2025-04-30 10:24:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:33,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2025-04-30 10:24:33,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4139, Invalid=9433, Unknown=0, NotChecked=0, Total=13572 [2025-04-30 10:24:33,794 INFO L87 Difference]: Start difference. First operand 617 states and 641 transitions. Second operand has 117 states, 116 states have (on average 4.224137931034483) internal successors, (490), 117 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:34,759 INFO L93 Difference]: Finished difference Result 849 states and 896 transitions. [2025-04-30 10:24:34,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-30 10:24:34,760 INFO L79 Accepts]: Start accepts. Automaton has has 117 states, 116 states have (on average 4.224137931034483) internal successors, (490), 117 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-04-30 10:24:34,760 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:34,762 INFO L225 Difference]: With dead ends: 849 [2025-04-30 10:24:34,762 INFO L226 Difference]: Without dead ends: 848 [2025-04-30 10:24:34,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7772 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5732, Invalid=14290, Unknown=0, NotChecked=0, Total=20022 [2025-04-30 10:24:34,764 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 270 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:34,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 365 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-04-30 10:24:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 833. [2025-04-30 10:24:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.0216606498194947) internal successors, (849), 832 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 849 transitions. [2025-04-30 10:24:34,782 INFO L79 Accepts]: Start accepts. Automaton has 833 states and 849 transitions. Word has length 209 [2025-04-30 10:24:34,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:34,782 INFO L485 AbstractCegarLoop]: Abstraction has 833 states and 849 transitions. [2025-04-30 10:24:34,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 116 states have (on average 4.224137931034483) internal successors, (490), 117 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:34,782 INFO L278 IsEmpty]: Start isEmpty. Operand 833 states and 849 transitions. [2025-04-30 10:24:34,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-04-30 10:24:34,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:34,784 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 30, 30, 1, 1, 1, 1, 1, 1] [2025-04-30 10:24:34,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:24:34,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:34,985 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:34,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1294128000, now seen corresponding path program 4 times [2025-04-30 10:24:34,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:34,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287575718] [2025-04-30 10:24:34,985 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:34,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:35,007 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 286 statements into 2 equivalence classes. [2025-04-30 10:24:35,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 286 of 286 statements. [2025-04-30 10:24:35,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:35,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4279 backedges. 4 proven. 4275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:40,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:40,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287575718] [2025-04-30 10:24:40,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287575718] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:40,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924303607] [2025-04-30 10:24:40,319 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:40,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:40,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:40,321 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:40,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:24:40,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 286 statements into 2 equivalence classes. [2025-04-30 10:24:40,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 286 of 286 statements. [2025-04-30 10:24:40,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:40,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:40,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-30 10:24:40,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:40,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:24:40,550 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:24:40,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:40,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:40,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:40,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:24:41,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:24:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4279 backedges. 0 proven. 4279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:41,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4279 backedges. 0 proven. 4279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924303607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:44,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 65, 65] total 191 [2025-04-30 10:24:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938119229] [2025-04-30 10:24:44,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:44,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-04-30 10:24:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:44,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-04-30 10:24:44,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9446, Invalid=27226, Unknown=0, NotChecked=0, Total=36672 [2025-04-30 10:24:44,787 INFO L87 Difference]: Start difference. First operand 833 states and 849 transitions. Second operand has 192 states, 191 states have (on average 3.654450261780105) internal successors, (698), 192 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:50,647 INFO L93 Difference]: Finished difference Result 1004 states and 1036 transitions. [2025-04-30 10:24:50,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2025-04-30 10:24:50,647 INFO L79 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 3.654450261780105) internal successors, (698), 192 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2025-04-30 10:24:50,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:50,650 INFO L225 Difference]: With dead ends: 1004 [2025-04-30 10:24:50,650 INFO L226 Difference]: Without dead ends: 1003 [2025-04-30 10:24:50,655 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47882 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=26211, Invalid=93159, Unknown=0, NotChecked=0, Total=119370 [2025-04-30 10:24:50,656 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 336 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:50,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 338 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:24:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-04-30 10:24:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 986. [2025-04-30 10:24:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 984 states have (on average 1.0193089430894309) internal successors, (1003), 985 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1003 transitions. [2025-04-30 10:24:50,677 INFO L79 Accepts]: Start accepts. Automaton has 986 states and 1003 transitions. Word has length 286 [2025-04-30 10:24:50,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:50,677 INFO L485 AbstractCegarLoop]: Abstraction has 986 states and 1003 transitions. [2025-04-30 10:24:50,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 3.654450261780105) internal successors, (698), 192 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:50,678 INFO L278 IsEmpty]: Start isEmpty. Operand 986 states and 1003 transitions. [2025-04-30 10:24:50,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-04-30 10:24:50,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:50,682 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2025-04-30 10:24:50,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:24:50,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:50,882 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:24:50,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:50,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1656282739, now seen corresponding path program 5 times [2025-04-30 10:24:50,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:50,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287796503] [2025-04-30 10:24:50,883 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:24:50,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:50,909 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 423 statements into 47 equivalence classes. [2025-04-30 10:24:51,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 423 of 423 statements. [2025-04-30 10:24:51,171 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:24:51,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15