./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:58:53,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:58:53,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:58:53,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:58:53,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:58:53,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:58:53,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:58:53,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:58:53,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:58:53,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:58:53,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:58:53,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:58:53,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:58:53,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:58:53,727 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:58:53,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:58:53,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:58:53,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:58:53,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:58:53,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:58:53,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:58:53,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:58:53,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:58:53,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:58:53,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:58:53,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:58:53,730 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2025-03-17 14:58:53,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:58:53,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:58:53,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:58:53,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:58:53,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:58:53,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2025-03-17 14:58:55,041 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0506445/7d804b6ee1ff43458875991dc41962d6/FLAG880e93ce0 [2025-03-17 14:58:55,270 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:58:55,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2025-03-17 14:58:55,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0506445/7d804b6ee1ff43458875991dc41962d6/FLAG880e93ce0 [2025-03-17 14:58:55,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0506445/7d804b6ee1ff43458875991dc41962d6 [2025-03-17 14:58:55,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:58:55,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:58:55,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:58:55,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:58:55,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:58:55,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52805eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55, skipping insertion in model container [2025-03-17 14:58:55,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:58:55,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:58:55,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:58:55,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:58:55,912 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:58:55,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55 WrapperNode [2025-03-17 14:58:55,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:58:55,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:58:55,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:58:55,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:58:55,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,939 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 124 [2025-03-17 14:58:55,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:58:55,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:58:55,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:58:55,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:58:55,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,960 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-17 14:58:55,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:58:55,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:58:55,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:58:55,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:58:55,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (1/1) ... [2025-03-17 14:58:55,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:58:55,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:56,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:58:56,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:58:56,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:58:56,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:58:56,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:58:56,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:58:56,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:58:56,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:58:56,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:58:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:58:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:58:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:58:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:58:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:58:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:58:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:58:56,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:58:56,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:58:56,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:58:56,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 14:58:56,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc sll_get_data_at_#t~mem9#1; [2025-03-17 14:58:56,279 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-17 14:58:56,279 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:58:56,289 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:58:56,289 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:58:56,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:56 BoogieIcfgContainer [2025-03-17 14:58:56,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:58:56,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:58:56,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:58:56,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:58:56,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:58:55" (1/3) ... [2025-03-17 14:58:56,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a3982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:56, skipping insertion in model container [2025-03-17 14:58:56,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:55" (2/3) ... [2025-03-17 14:58:56,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a3982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:56, skipping insertion in model container [2025-03-17 14:58:56,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:56" (3/3) ... [2025-03-17 14:58:56,296 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2025-03-17 14:58:56,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:58:56,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all_reverse.i that has 1 procedures, 54 locations, 1 initial locations, 6 loop locations, and 18 error locations. [2025-03-17 14:58:56,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:58:56,359 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ed675eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:58:56,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:58:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:58:56,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:56,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:58:56,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 96962, now seen corresponding path program 1 times [2025-03-17 14:58:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:56,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164355440] [2025-03-17 14:58:56,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:56,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:58:56,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:58:56,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:56,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164355440] [2025-03-17 14:58:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164355440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:58:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724092957] [2025-03-17 14:58:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:56,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:56,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:56,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:56,513 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:56,546 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-03-17 14:58:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 14:58:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:56,552 INFO L225 Difference]: With dead ends: 57 [2025-03-17 14:58:56,553 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 14:58:56,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:56,559 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:56,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 44 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 14:58:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 14:58:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-17 14:58:56,591 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 3 [2025-03-17 14:58:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:56,592 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-17 14:58:56,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-17 14:58:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:58:56,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:56,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:58:56,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:58:56,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:56,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash 3005845, now seen corresponding path program 1 times [2025-03-17 14:58:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281193045] [2025-03-17 14:58:56,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:56,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:58:56,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:58:56,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:56,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281193045] [2025-03-17 14:58:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281193045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:56,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073621636] [2025-03-17 14:58:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:56,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:56,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:56,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:56,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:56,678 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:56,717 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2025-03-17 14:58:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:56,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-17 14:58:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:56,718 INFO L225 Difference]: With dead ends: 83 [2025-03-17 14:58:56,718 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 14:58:56,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:56,719 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:56,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 14:58:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-17 14:58:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 44 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-03-17 14:58:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-17 14:58:56,727 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2025-03-17 14:58:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:56,728 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-17 14:58:56,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-17 14:58:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:58:56,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:56,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:58:56,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:58:56,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 93489985, now seen corresponding path program 1 times [2025-03-17 14:58:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17178358] [2025-03-17 14:58:56,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:58:56,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:58:56,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:56,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:56,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17178358] [2025-03-17 14:58:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17178358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:56,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:56,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:58:56,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488292058] [2025-03-17 14:58:56,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:56,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:56,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:56,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:56,832 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:56,855 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-03-17 14:58:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:56,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-17 14:58:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:56,857 INFO L225 Difference]: With dead ends: 45 [2025-03-17 14:58:56,857 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 14:58:56,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:56,858 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:56,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 14:58:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 14:58:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-17 14:58:56,861 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 5 [2025-03-17 14:58:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:56,861 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-17 14:58:56,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-17 14:58:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:58:56,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:56,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:58:56,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:58:56,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1396777733, now seen corresponding path program 1 times [2025-03-17 14:58:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321026153] [2025-03-17 14:58:56,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:56,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:58:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:58:56,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:56,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321026153] [2025-03-17 14:58:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321026153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:56,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714014584] [2025-03-17 14:58:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:56,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:56,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:56,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:56,928 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:56,958 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-03-17 14:58:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-17 14:58:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:56,959 INFO L225 Difference]: With dead ends: 44 [2025-03-17 14:58:56,959 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 14:58:56,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:56,960 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:56,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 14:58:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 14:58:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-17 14:58:56,963 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 6 [2025-03-17 14:58:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:56,963 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-17 14:58:56,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-17 14:58:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:58:56,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:56,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:56,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:58:56,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1762253410, now seen corresponding path program 1 times [2025-03-17 14:58:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:56,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121815140] [2025-03-17 14:58:56,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:58:56,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:58:56,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:56,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:58:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121815140] [2025-03-17 14:58:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121815140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:58:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108064523] [2025-03-17 14:58:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:57,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:57,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:57,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:57,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:57,010 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-03-17 14:58:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:57,027 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-03-17 14:58:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:57,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-03-17 14:58:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:57,030 INFO L225 Difference]: With dead ends: 43 [2025-03-17 14:58:57,031 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 14:58:57,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:57,031 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:57,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 14:58:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 14:58:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-17 14:58:57,038 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 9 [2025-03-17 14:58:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:57,038 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-17 14:58:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-03-17 14:58:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-17 14:58:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:58:57,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:57,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:57,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:58:57,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:57,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1308411716, now seen corresponding path program 1 times [2025-03-17 14:58:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643326875] [2025-03-17 14:58:57,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:57,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:58:57,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:58:57,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:58:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643326875] [2025-03-17 14:58:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643326875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:57,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:57,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232120978] [2025-03-17 14:58:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:57,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:57,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:57,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:57,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:57,111 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:57,162 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-03-17 14:58:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:58:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:57,162 INFO L225 Difference]: With dead ends: 43 [2025-03-17 14:58:57,162 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 14:58:57,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:58:57,163 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:57,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 38 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 14:58:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-17 14:58:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-03-17 14:58:57,168 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 11 [2025-03-17 14:58:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:57,168 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-03-17 14:58:57,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-03-17 14:58:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:58:57,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:57,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:57,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:58:57,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:57,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1906057515, now seen corresponding path program 1 times [2025-03-17 14:58:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14441167] [2025-03-17 14:58:57,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:57,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:58:57,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:58:57,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:57,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:58:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14441167] [2025-03-17 14:58:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14441167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40337952] [2025-03-17 14:58:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:57,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:57,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:57,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:57,239 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:57,290 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-03-17 14:58:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:57,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-03-17 14:58:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:57,291 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:58:57,292 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 14:58:57,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:58:57,293 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:57,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 14:58:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2025-03-17 14:58:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-17 14:58:57,301 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 12 [2025-03-17 14:58:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:57,301 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-17 14:58:57,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-17 14:58:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:58:57,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:57,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:57,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:58:57,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:57,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2065203469, now seen corresponding path program 1 times [2025-03-17 14:58:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908284076] [2025-03-17 14:58:57,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:57,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:57,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:58:57,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:58:57,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:57,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908284076] [2025-03-17 14:58:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908284076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520012644] [2025-03-17 14:58:57,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:57,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:57,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:57,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:58:57,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:58:57,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:58:57,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:57,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:57,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:58:57,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:57,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520012644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:57,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:57,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-17 14:58:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487871560] [2025-03-17 14:58:57,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:58:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:57,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:58:57,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:58:57,524 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:57,549 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2025-03-17 14:58:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:58:57,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-17 14:58:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:57,550 INFO L225 Difference]: With dead ends: 88 [2025-03-17 14:58:57,550 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 14:58:57,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:58:57,552 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:57,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 110 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 14:58:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 14:58:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.375) internal successors, (55), 49 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-03-17 14:58:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-17 14:58:57,557 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2025-03-17 14:58:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-17 14:58:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-17 14:58:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:58:57,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:57,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:57,565 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-03-17 14:58:57,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:57,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -805302340, now seen corresponding path program 2 times [2025-03-17 14:58:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109109337] [2025-03-17 14:58:57,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:58:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:57,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:58:57,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 19 statements. [2025-03-17 14:58:57,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:58:57,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:58:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109109337] [2025-03-17 14:58:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109109337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:57,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:57,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:58:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755583215] [2025-03-17 14:58:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:58:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:57,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:58:57,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:58:57,836 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:57,888 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-03-17 14:58:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:58:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-03-17 14:58:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:57,889 INFO L225 Difference]: With dead ends: 96 [2025-03-17 14:58:57,889 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 14:58:57,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:58:57,890 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:57,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 60 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 14:58:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2025-03-17 14:58:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 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-03-17 14:58:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2025-03-17 14:58:57,894 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 19 [2025-03-17 14:58:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:57,894 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2025-03-17 14:58:57,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2025-03-17 14:58:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:58:57,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:57,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:57,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:58:57,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:57,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash -805302180, now seen corresponding path program 1 times [2025-03-17 14:58:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509307375] [2025-03-17 14:58:57,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:57,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:58:57,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:58:57,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:57,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:58:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509307375] [2025-03-17 14:58:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509307375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:57,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841214436] [2025-03-17 14:58:57,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:57,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:57,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:57,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:57,946 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:57,955 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-03-17 14:58:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-03-17 14:58:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:57,957 INFO L225 Difference]: With dead ends: 51 [2025-03-17 14:58:57,957 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 14:58:57,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:57,957 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:57,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 14:58:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 14:58:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 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-03-17 14:58:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-17 14:58:57,963 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 19 [2025-03-17 14:58:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:57,963 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-17 14:58:57,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-03-17 14:58:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:58:57,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:57,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:57,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:58:57,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 805436208, now seen corresponding path program 1 times [2025-03-17 14:58:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569142683] [2025-03-17 14:58:57,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:57,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:58:57,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:58:57,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:57,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:58:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569142683] [2025-03-17 14:58:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569142683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:58:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67191416] [2025-03-17 14:58:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:58,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:58:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:58,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:58:58,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:58:58,065 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:58,130 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-17 14:58:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:58:58,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 14:58:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:58,131 INFO L225 Difference]: With dead ends: 61 [2025-03-17 14:58:58,131 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 14:58:58,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:58:58,131 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 63 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:58,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 93 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 14:58:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-03-17 14:58:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-17 14:58:58,137 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 20 [2025-03-17 14:58:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:58,137 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-17 14:58:58,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-17 14:58:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:58:58,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:58,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:58:58,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:58,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash 930082958, now seen corresponding path program 1 times [2025-03-17 14:58:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180507666] [2025-03-17 14:58:58,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:58,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:58:58,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:58:58,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:58:58,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:58,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180507666] [2025-03-17 14:58:58,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180507666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:58,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335534175] [2025-03-17 14:58:58,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:58,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:58,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:58,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:58,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:58:58,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:58:58,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:58:58,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:58,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:58,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:58:58,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:58:58,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:58:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335534175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:58,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:58:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 14:58:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343399093] [2025-03-17 14:58:58,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:58,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:58:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:58:58,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:58:58,358 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 5 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-03-17 14:58:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:58,421 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2025-03-17 14:58:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:58:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 22 [2025-03-17 14:58:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:58,423 INFO L225 Difference]: With dead ends: 63 [2025-03-17 14:58:58,423 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 14:58:58,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:58:58,424 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 63 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:58,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 66 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 14:58:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-03-17 14:58:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-03-17 14:58:58,431 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 22 [2025-03-17 14:58:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:58,432 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-03-17 14:58:58,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-03-17 14:58:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-03-17 14:58:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 14:58:58,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:58,433 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:58,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:58,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:58:58,633 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:58,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1232199367, now seen corresponding path program 1 times [2025-03-17 14:58:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:58,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825315727] [2025-03-17 14:58:58,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:58,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:58:58,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:58:58,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:58,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:58:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825315727] [2025-03-17 14:58:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825315727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:58:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285570476] [2025-03-17 14:58:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:58,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:58:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:58,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:58:58,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:58:58,711 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-03-17 14:58:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:58,758 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-17 14:58:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:58:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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) Word has length 23 [2025-03-17 14:58:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:58,758 INFO L225 Difference]: With dead ends: 61 [2025-03-17 14:58:58,758 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 14:58:58,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:58:58,759 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:58,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 58 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 14:58:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-03-17 14:58:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-17 14:58:58,767 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2025-03-17 14:58:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:58,767 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-17 14:58:58,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-03-17 14:58:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-17 14:58:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:58:58,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:58,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:58,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:58:58,769 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:58,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash -460092360, now seen corresponding path program 1 times [2025-03-17 14:58:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:58,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94202294] [2025-03-17 14:58:58,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:58,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:58,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:58:58,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:58:58,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:58,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94202294] [2025-03-17 14:58:58,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94202294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:58,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:58,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:58:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225570313] [2025-03-17 14:58:58,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:58,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:58,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:58,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:58,828 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:58,853 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-17 14:58:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:58,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 28 [2025-03-17 14:58:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:58,854 INFO L225 Difference]: With dead ends: 52 [2025-03-17 14:58:58,854 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 14:58:58,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:58,855 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:58,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 14:58:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-17 14:58:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.25) internal successors, (55), 49 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-03-17 14:58:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-17 14:58:58,860 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 28 [2025-03-17 14:58:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:58,860 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-17 14:58:58,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-17 14:58:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:58:58,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:58,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:58,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:58:58,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:58,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1377956300, now seen corresponding path program 1 times [2025-03-17 14:58:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:58,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603479010] [2025-03-17 14:58:58,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:58,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:58:58,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:58:58,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:58,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:58:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603479010] [2025-03-17 14:58:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603479010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040347348] [2025-03-17 14:58:59,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:59,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:59,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:59,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:58:59,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:58:59,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:58:59,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:59,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:59,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:58:59,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:58:59,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:58:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040347348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:59,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2025-03-17 14:58:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788376111] [2025-03-17 14:58:59,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:59,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:58:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:59,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:58:59,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:58:59,211 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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-03-17 14:58:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:59,299 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-03-17 14:58:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:58:59,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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) Word has length 29 [2025-03-17 14:58:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:59,299 INFO L225 Difference]: With dead ends: 83 [2025-03-17 14:58:59,300 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 14:58:59,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:58:59,300 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:59,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 98 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 14:58:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2025-03-17 14:58:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-03-17 14:58:59,304 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 29 [2025-03-17 14:58:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:59,304 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-03-17 14:58:59,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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-03-17 14:58:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-03-17 14:58:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:58:59,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:59,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:59,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:58:59,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:59,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:59,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 422415523, now seen corresponding path program 1 times [2025-03-17 14:58:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454189588] [2025-03-17 14:58:59,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:59,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:58:59,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:58:59,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:59,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:59,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:59,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454189588] [2025-03-17 14:58:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454189588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:59,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549374150] [2025-03-17 14:58:59,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:59,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:59,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:59,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:59,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:59,562 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 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-03-17 14:58:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:59,569 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-03-17 14:58:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:59,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 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) Word has length 31 [2025-03-17 14:58:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:59,569 INFO L225 Difference]: With dead ends: 47 [2025-03-17 14:58:59,569 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 14:58:59,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:59,570 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:59,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 14:58:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 14:58:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-03-17 14:58:59,573 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2025-03-17 14:58:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:59,573 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-03-17 14:58:59,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 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-03-17 14:58:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-03-17 14:58:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 14:58:59,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:59,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:59,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:58:59,574 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:58:59,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 209979318, now seen corresponding path program 1 times [2025-03-17 14:58:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634889164] [2025-03-17 14:58:59,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:59,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:58:59,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:58:59,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:59,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:58:59,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634889164] [2025-03-17 14:58:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634889164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675019928] [2025-03-17 14:58:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:59,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:59,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:59,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:59,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:58:59,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:58:59,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:58:59,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:59,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:59,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:58:59,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:58:59,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:58:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675019928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:59,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-17 14:58:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039329393] [2025-03-17 14:58:59,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:59,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:58:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:59,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:58:59,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:58:59,846 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:59,898 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-03-17 14:58:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:58:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 14:58:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:59,898 INFO L225 Difference]: With dead ends: 74 [2025-03-17 14:58:59,898 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 14:58:59,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:58:59,899 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 64 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:59,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 63 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 14:58:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-03-17 14:58:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 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-03-17 14:58:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-03-17 14:58:59,906 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 32 [2025-03-17 14:58:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:59,906 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-03-17 14:58:59,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-03-17 14:58:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 14:58:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:59,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:59,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:00,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:59:00,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:59:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1107334880, now seen corresponding path program 2 times [2025-03-17 14:59:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179647380] [2025-03-17 14:59:00,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:00,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:59:00,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 38 statements. [2025-03-17 14:59:00,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:00,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:59:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:00,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179647380] [2025-03-17 14:59:00,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179647380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:00,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:00,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:59:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035383573] [2025-03-17 14:59:00,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:59:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:00,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:59:00,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:59:00,161 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:00,219 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2025-03-17 14:59:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:59:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 38 [2025-03-17 14:59:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:00,220 INFO L225 Difference]: With dead ends: 55 [2025-03-17 14:59:00,220 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 14:59:00,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:59:00,221 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:00,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 69 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 14:59:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-17 14:59:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.1875) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-17 14:59:00,225 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 38 [2025-03-17 14:59:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:00,226 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-17 14:59:00,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-17 14:59:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:59:00,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:00,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:00,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:59:00,228 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:59:00,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash -32511982, now seen corresponding path program 1 times [2025-03-17 14:59:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437116214] [2025-03-17 14:59:00,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:00,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:59:00,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:59:00,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:00,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:59:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:00,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437116214] [2025-03-17 14:59:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437116214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:00,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:00,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:59:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181600656] [2025-03-17 14:59:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:00,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:00,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:00,276 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:00,304 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-17 14:59:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:00,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 39 [2025-03-17 14:59:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:00,305 INFO L225 Difference]: With dead ends: 52 [2025-03-17 14:59:00,305 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 14:59:00,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:00,305 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 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-03-17 14:59:00,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 14:59:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 14:59:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-17 14:59:00,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 39 [2025-03-17 14:59:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:00,311 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-17 14:59:00,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-17 14:59:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 14:59:00,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:00,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:00,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:59:00,312 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:59:00,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:00,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1007871462, now seen corresponding path program 1 times [2025-03-17 14:59:00,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:00,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845459063] [2025-03-17 14:59:00,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:00,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:00,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 14:59:00,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 14:59:00,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:00,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:59:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845459063] [2025-03-17 14:59:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845459063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:59:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52882335] [2025-03-17 14:59:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:59:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:00,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:59:00,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:00,383 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-03-17 14:59:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:00,424 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-03-17 14:59:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:59:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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) Word has length 40 [2025-03-17 14:59:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:00,425 INFO L225 Difference]: With dead ends: 67 [2025-03-17 14:59:00,425 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 14:59:00,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:59:00,426 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:00,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 53 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 14:59:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-17 14:59:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.163265306122449) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-17 14:59:00,429 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 40 [2025-03-17 14:59:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:00,429 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-17 14:59:00,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-03-17 14:59:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-17 14:59:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 14:59:00,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:00,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:00,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:59:00,430 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:59:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1924450741, now seen corresponding path program 1 times [2025-03-17 14:59:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715000421] [2025-03-17 14:59:00,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:00,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 14:59:00,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 14:59:00,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:00,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:59:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715000421] [2025-03-17 14:59:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715000421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370673874] [2025-03-17 14:59:00,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:00,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:00,574 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:00,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:59:00,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 14:59:00,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 14:59:00,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:00,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:59:00,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:59:00,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:59:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370673874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:59:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-03-17 14:59:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289770513] [2025-03-17 14:59:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:00,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:59:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:00,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:59:00,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:59:00,739 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:00,772 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-17 14:59:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:59:00,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 14:59:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:00,773 INFO L225 Difference]: With dead ends: 52 [2025-03-17 14:59:00,773 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 14:59:00,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:59:00,773 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:00,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 14:59:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 14:59:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 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-03-17 14:59:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-17 14:59:00,776 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2025-03-17 14:59:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:00,776 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-17 14:59:00,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-17 14:59:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 14:59:00,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:00,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:00,783 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-03-17 14:59:00,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:00,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:59:00,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash -898979184, now seen corresponding path program 1 times [2025-03-17 14:59:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412821755] [2025-03-17 14:59:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:00,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:59:00,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:59:00,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:59:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412821755] [2025-03-17 14:59:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412821755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515307975] [2025-03-17 14:59:01,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:01,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:01,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:01,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:01,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:59:01,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:59:01,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:59:01,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:01,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:01,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:59:01,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:59:01,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:59:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515307975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:01,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2025-03-17 14:59:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945000668] [2025-03-17 14:59:01,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:01,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:59:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:01,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:59:01,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:59:01,337 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:01,417 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-03-17 14:59:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:59:01,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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 49 [2025-03-17 14:59:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:01,418 INFO L225 Difference]: With dead ends: 60 [2025-03-17 14:59:01,418 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:59:01,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:59:01,419 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:01,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 72 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:59:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:59:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:59:01,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-03-17 14:59:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:59:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:59:01,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-17 14:59:01,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-17 14:59:01,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:01,626 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:01,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:59:01,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:59:01,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:59:01,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:59:01,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:59:01,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:59:01,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:59:01,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:59:01,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:59:01,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:59:01,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:59:01,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:59:01,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:59:01,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:59:01 BoogieIcfgContainer [2025-03-17 14:59:01,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:59:01,734 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:59:01,734 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:59:01,734 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:59:01,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:56" (3/4) ... [2025-03-17 14:59:01,736 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:59:01,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 14:59:01,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 14:59:01,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:59:01,743 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:59:01,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:59:01,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:59:01,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:59:01,807 INFO L158 Benchmark]: Toolchain (without parser) took 6200.24ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 131.8MB in the beginning and 93.6MB in the end (delta: 38.2MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-03-17 14:59:01,807 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:01,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.65ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 113.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:59:01,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.55ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 112.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:01,809 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:01,809 INFO L158 Benchmark]: IcfgBuilder took 309.30ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 91.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:59:01,809 INFO L158 Benchmark]: TraceAbstraction took 5442.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 91.5MB in the beginning and 101.3MB in the end (delta: -9.8MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-03-17 14:59:01,809 INFO L158 Benchmark]: Witness Printer took 71.29ms. Allocated memory is still 201.3MB. Free memory was 101.3MB in the beginning and 93.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:01,812 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.65ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 113.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.55ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 112.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 309.30ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 91.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5442.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 91.5MB in the beginning and 101.3MB in the end (delta: -9.8MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 71.29ms. Allocated memory is still 201.3MB. Free memory was 101.3MB in the beginning and 93.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 62 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 1525 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 889 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 889 IncrementalHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 636 mSDtfsCounter, 889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 301 SyntacticMatches, 14 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 68 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 685 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 2007 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 32 InterpolantComputations, 18 PerfectInterpolantSequences, 286/308 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 622]: Location Invariant Derived location invariant: (((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) - InvariantResult [Line: 600]: Location Invariant Derived location invariant: ((index <= 1) || (index == 0)) - InvariantResult [Line: 618]: Location Invariant Derived location invariant: (((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) - InvariantResult [Line: 585]: Location Invariant Derived location invariant: ((len == 2) && (len <= 2)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:59:01,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE