./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-ext-properties/test-0504_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext-properties/test-0504_1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:38:23,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:38:23,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:38:23,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:38:23,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:38:23,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:38:23,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:38:23,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:38:23,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:38:23,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:38:23,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:38:23,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:38:23,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:38:23,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:38:23,344 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:38:23,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:38:23,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:38:23,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:38:23,345 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:38:23,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:38:23,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:38:23,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:38:23,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:38:23,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:38:23,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:38:23,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:38:23,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:38:23,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:23,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:38:23,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:38:23,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:38:23,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:38:23,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:23,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:38:23,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:38:23,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:38:23,348 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2025-01-10 01:38:23,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:38:23,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:38:23,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:38:23,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:38:23,644 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:38:23,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2025-01-10 01:38:24,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c17b3e3c7/c799c68b32fc4d108a293448b3b2890c/FLAGf7d10da8f [2025-01-10 01:38:25,256 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:38:25,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2025-01-10 01:38:25,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c17b3e3c7/c799c68b32fc4d108a293448b3b2890c/FLAGf7d10da8f [2025-01-10 01:38:25,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c17b3e3c7/c799c68b32fc4d108a293448b3b2890c [2025-01-10 01:38:25,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:38:25,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:38:25,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:38:25,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:38:25,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:38:25,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e39b515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25, skipping insertion in model container [2025-01-10 01:38:25,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:38:25,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:38:25,728 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:38:25,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:38:25,824 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:38:25,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25 WrapperNode [2025-01-10 01:38:25,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:38:25,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:38:25,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:38:25,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:38:25,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,863 INFO L138 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2025-01-10 01:38:25,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:38:25,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:38:25,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:38:25,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:38:25,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,892 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-01-10 01:38:25,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:38:25,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:38:25,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:38:25,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:38:25,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (1/1) ... [2025-01-10 01:38:25,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:25,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:38:25,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:38:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:38:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:38:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:38:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:38:25,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:38:26,076 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:38:26,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:38:26,328 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-10 01:38:26,329 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:38:26,343 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:38:26,343 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:38:26,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:26 BoogieIcfgContainer [2025-01-10 01:38:26,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:38:26,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:38:26,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:38:26,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:38:26,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:38:25" (1/3) ... [2025-01-10 01:38:26,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8e3a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:38:26, skipping insertion in model container [2025-01-10 01:38:26,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:25" (2/3) ... [2025-01-10 01:38:26,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8e3a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:38:26, skipping insertion in model container [2025-01-10 01:38:26,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:26" (3/3) ... [2025-01-10 01:38:26,360 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2025-01-10 01:38:26,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:38:26,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0504_1.i that has 1 procedures, 44 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-01-10 01:38:26,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:38:26,429 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;@3533f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:38:26,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:38:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 43 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-01-10 01:38:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:38:26,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:26,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:38:26,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 28767309, now seen corresponding path program 1 times [2025-01-10 01:38:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59689269] [2025-01-10 01:38:26,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:26,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:38:26,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:38:26,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:26,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59689269] [2025-01-10 01:38:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59689269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:38:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244321684] [2025-01-10 01:38:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:26,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:38:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:26,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:38:26,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:38:26,570 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 43 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-01-10 01:38:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:26,579 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2025-01-10 01:38:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:38:26,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-01-10 01:38:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:26,585 INFO L225 Difference]: With dead ends: 86 [2025-01-10 01:38:26,585 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:38:26,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:38:26,589 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:26,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:38:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-10 01:38:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 40 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-01-10 01:38:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-01-10 01:38:26,618 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 5 [2025-01-10 01:38:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:26,618 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-01-10 01:38:26,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-01-10 01:38:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-01-10 01:38:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:38:26,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:26,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:38:26,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:26,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1805896876, now seen corresponding path program 1 times [2025-01-10 01:38:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:26,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038273719] [2025-01-10 01:38:26,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:26,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:38:26,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:38:26,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:26,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038273719] [2025-01-10 01:38:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038273719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:26,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766634654] [2025-01-10 01:38:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:26,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:38:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:26,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:38:26,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:38:26,716 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-01-10 01:38:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:26,755 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-01-10 01:38:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:38:26,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-10 01:38:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:26,756 INFO L225 Difference]: With dead ends: 54 [2025-01-10 01:38:26,756 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 01:38:26,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:38:26,757 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:26,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 01:38:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-01-10 01:38:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-01-10 01:38:26,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 7 [2025-01-10 01:38:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:26,769 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-01-10 01:38:26,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-01-10 01:38:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-01-10 01:38:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:38:26,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:26,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:26,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:38:26,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:26,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1805892906, now seen corresponding path program 1 times [2025-01-10 01:38:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:26,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108852755] [2025-01-10 01:38:26,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:26,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:38:26,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:38:26,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:26,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108852755] [2025-01-10 01:38:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108852755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21903435] [2025-01-10 01:38:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:26,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:26,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:26,875 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-01-10 01:38:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:26,926 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-01-10 01:38:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-10 01:38:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:26,927 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:38:26,927 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 01:38:26,927 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-01-10 01:38:26,928 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:26,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 01:38:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 01:38:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 46 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-01-10 01:38:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-01-10 01:38:26,936 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 7 [2025-01-10 01:38:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:26,937 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-01-10 01:38:26,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-01-10 01:38:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-01-10 01:38:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:38:26,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:26,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:26,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:38:26,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:26,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:26,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1273368849, now seen corresponding path program 1 times [2025-01-10 01:38:26,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:26,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872508214] [2025-01-10 01:38:26,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:38:26,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:38:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872508214] [2025-01-10 01:38:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872508214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:27,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:38:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353896612] [2025-01-10 01:38:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:38:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:27,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:38:27,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:27,100 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-01-10 01:38:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:27,211 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2025-01-10 01:38:27,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:38:27,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-01-10 01:38:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:27,212 INFO L225 Difference]: With dead ends: 72 [2025-01-10 01:38:27,212 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 01:38:27,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:27,213 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 26 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:27,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 141 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 01:38:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2025-01-10 01:38:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.45) internal successors, (58), 49 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-01-10 01:38:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-10 01:38:27,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 11 [2025-01-10 01:38:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:27,219 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-10 01:38:27,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-01-10 01:38:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-10 01:38:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:38:27,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:27,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:27,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:38:27,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:27,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 819728719, now seen corresponding path program 1 times [2025-01-10 01:38:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:27,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947679602] [2025-01-10 01:38:27,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:27,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:38:27,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:38:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947679602] [2025-01-10 01:38:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947679602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:38:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449192397] [2025-01-10 01:38:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:27,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:38:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:27,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:38:27,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:27,374 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-01-10 01:38:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:27,459 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2025-01-10 01:38:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:38:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-01-10 01:38:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:27,460 INFO L225 Difference]: With dead ends: 72 [2025-01-10 01:38:27,460 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 01:38:27,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:27,461 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:27,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 01:38:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2025-01-10 01:38:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 50 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-01-10 01:38:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-01-10 01:38:27,468 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 12 [2025-01-10 01:38:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:27,468 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-10 01:38:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-01-10 01:38:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-01-10 01:38:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:38:27,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:27,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:27,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:38:27,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:27,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2051729443, now seen corresponding path program 1 times [2025-01-10 01:38:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075188702] [2025-01-10 01:38:27,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:27,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:27,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:38:27,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:38:27,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:27,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:27,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:27,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075188702] [2025-01-10 01:38:27,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075188702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:27,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835661044] [2025-01-10 01:38:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:27,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:27,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:27,587 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-01-10 01:38:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:27,626 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-01-10 01:38:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-10 01:38:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:27,627 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:38:27,627 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 01:38:27,628 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-01-10 01:38:27,629 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:27,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 94 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 01:38:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-01-10 01:38:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.425531914893617) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 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-01-10 01:38:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-01-10 01:38:27,634 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 17 [2025-01-10 01:38:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:27,634 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-01-10 01:38:27,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-01-10 01:38:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-01-10 01:38:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:38:27,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:27,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:27,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:38:27,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:27,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:27,637 INFO L85 PathProgramCache]: Analyzing trace with hash -207363516, now seen corresponding path program 1 times [2025-01-10 01:38:27,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:27,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043135934] [2025-01-10 01:38:27,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:27,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:27,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:27,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:27,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:38:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601875630] [2025-01-10 01:38:27,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:27,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:27,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:27,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:38:27,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:38:27,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:27,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:27,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:27,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:27,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:38:27,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:28,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:38:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:28,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043135934] [2025-01-10 01:38:28,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:38:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601875630] [2025-01-10 01:38:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601875630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:28,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:28,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:38:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278173848] [2025-01-10 01:38:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:38:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:38:28,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:38:28,019 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-10 01:38:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:28,108 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-01-10 01:38:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:38:28,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-01-10 01:38:28,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:28,110 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:38:28,110 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 01:38:28,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:38:28,111 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:28,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 137 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 01:38:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-01-10 01:38:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 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-01-10 01:38:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-01-10 01:38:28,120 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2025-01-10 01:38:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:28,120 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-01-10 01:38:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-10 01:38:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-01-10 01:38:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:38:28,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:28,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:28,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:38:28,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:28,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:28,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2133301604, now seen corresponding path program 1 times [2025-01-10 01:38:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910685353] [2025-01-10 01:38:28,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:28,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:38:28,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:38:28,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:28,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:38:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064721222] [2025-01-10 01:38:28,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:28,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:28,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:38:28,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:38:28,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:38:28,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:38:28,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:28,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:28,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:38:28,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:28,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:38:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910685353] [2025-01-10 01:38:28,602 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:38:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064721222] [2025-01-10 01:38:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064721222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:38:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910159047] [2025-01-10 01:38:28,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:28,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:38:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:28,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:38:28,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:38:28,603 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-01-10 01:38:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:28,684 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2025-01-10 01:38:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:38:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-01-10 01:38:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:28,685 INFO L225 Difference]: With dead ends: 80 [2025-01-10 01:38:28,686 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 01:38:28,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:38:28,686 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:28,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 159 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 01:38:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-01-10 01:38:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 68 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2025-01-10 01:38:28,692 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 22 [2025-01-10 01:38:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:28,692 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2025-01-10 01:38:28,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-01-10 01:38:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2025-01-10 01:38:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:38:28,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:28,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:28,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:38:28,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:28,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:28,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1125571741, now seen corresponding path program 1 times [2025-01-10 01:38:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:28,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913541477] [2025-01-10 01:38:28,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:28,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:38:28,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:38:28,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:28,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:38:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:28,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913541477] [2025-01-10 01:38:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913541477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:28,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:28,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:38:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419139157] [2025-01-10 01:38:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:28,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:38:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:28,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:38:28,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:38:28,951 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-10 01:38:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:28,960 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-01-10 01:38:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:38:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-10 01:38:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:28,962 INFO L225 Difference]: With dead ends: 69 [2025-01-10 01:38:28,962 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 01:38:28,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:38:28,963 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:28,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 01:38:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 01:38:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 67 states have internal predecessors, (83), 0 states have call successors, (0), 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-01-10 01:38:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2025-01-10 01:38:28,972 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 23 [2025-01-10 01:38:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:28,972 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2025-01-10 01:38:28,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-10 01:38:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2025-01-10 01:38:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:38:28,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:28,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:38:28,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -532985486, now seen corresponding path program 1 times [2025-01-10 01:38:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:28,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910406069] [2025-01-10 01:38:28,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:28,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:38:28,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:38:28,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:28,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:29,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910406069] [2025-01-10 01:38:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910406069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:29,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128651318] [2025-01-10 01:38:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:29,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:29,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:29,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:29,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:29,032 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:29,058 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2025-01-10 01:38:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-10 01:38:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:29,059 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:38:29,059 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:38:29,060 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-01-10 01:38:29,062 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:29,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:38:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 01:38:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.280701754385965) internal successors, (73), 60 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-01-10 01:38:29,070 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 24 [2025-01-10 01:38:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:29,070 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-01-10 01:38:29,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-01-10 01:38:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:38:29,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:29,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:29,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:38:29,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:29,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash -533108620, now seen corresponding path program 1 times [2025-01-10 01:38:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:29,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641070925] [2025-01-10 01:38:29,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:29,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:38:29,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:38:29,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:29,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641070925] [2025-01-10 01:38:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641070925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606600646] [2025-01-10 01:38:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:29,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:29,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:29,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:29,132 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:29,161 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-01-10 01:38:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:29,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-10 01:38:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:29,162 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:38:29,162 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 01:38:29,162 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-01-10 01:38:29,163 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:29,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 52 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 01:38:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-10 01:38:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 57 states have (on average 1.263157894736842) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 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-01-10 01:38:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-01-10 01:38:29,167 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 24 [2025-01-10 01:38:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:29,167 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-01-10 01:38:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-01-10 01:38:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:38:29,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:29,168 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-01-10 01:38:29,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:38:29,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:29,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash -607955720, now seen corresponding path program 1 times [2025-01-10 01:38:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342986352] [2025-01-10 01:38:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:29,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:38:29,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:38:29,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:29,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:29,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:29,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342986352] [2025-01-10 01:38:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342986352] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:29,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877743534] [2025-01-10 01:38:29,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:29,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:29,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:29,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:38:29,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:38:29,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:38:29,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:38:29,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:29,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:29,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:38:29,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:29,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:29,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877743534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:29,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:29,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:38:29,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430738893] [2025-01-10 01:38:29,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:29,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:38:29,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:29,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:38:29,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:38:29,570 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 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-01-10 01:38:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:29,659 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2025-01-10 01:38:29,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:38:29,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-10 01:38:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:29,660 INFO L225 Difference]: With dead ends: 135 [2025-01-10 01:38:29,660 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 01:38:29,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:38:29,661 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 113 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:29,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 175 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 01:38:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2025-01-10 01:38:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.2578125) internal successors, (161), 130 states have internal predecessors, (161), 0 states have call successors, (0), 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-01-10 01:38:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2025-01-10 01:38:29,669 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 28 [2025-01-10 01:38:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:29,669 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2025-01-10 01:38:29,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 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-01-10 01:38:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2025-01-10 01:38:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:38:29,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:29,670 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] [2025-01-10 01:38:29,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:38:29,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:29,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:29,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash -287945819, now seen corresponding path program 1 times [2025-01-10 01:38:29,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:29,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4400526] [2025-01-10 01:38:29,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:29,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:29,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:38:29,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:38:29,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:29,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:38:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4400526] [2025-01-10 01:38:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4400526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:38:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657777908] [2025-01-10 01:38:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:29,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:38:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:29,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:38:29,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:29,984 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-01-10 01:38:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:30,028 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2025-01-10 01:38:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:38:30,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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 28 [2025-01-10 01:38:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:30,030 INFO L225 Difference]: With dead ends: 139 [2025-01-10 01:38:30,031 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 01:38:30,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:30,032 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:30,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 01:38:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2025-01-10 01:38:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.2019230769230769) internal successors, (125), 105 states have internal predecessors, (125), 0 states have call successors, (0), 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-01-10 01:38:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2025-01-10 01:38:30,043 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 28 [2025-01-10 01:38:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:30,043 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2025-01-10 01:38:30,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-01-10 01:38:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2025-01-10 01:38:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 01:38:30,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:30,044 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 01:38:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:38:30,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:38:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 482470661, now seen corresponding path program 1 times [2025-01-10 01:38:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232404227] [2025-01-10 01:38:30,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:30,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:38:30,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:38:30,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:30,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:38:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138551030] [2025-01-10 01:38:30,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:30,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:30,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:30,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:38:30,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:38:30,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:38:30,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:38:30,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:30,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:30,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:38:30,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:30,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:38:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232404227] [2025-01-10 01:38:53,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:38:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138551030] [2025-01-10 01:38:53,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138551030] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:53,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:38:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-01-10 01:38:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474844550] [2025-01-10 01:38:53,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:53,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:38:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:53,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:38:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=236, Unknown=6, NotChecked=0, Total=306 [2025-01-10 01:38:53,252 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 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-01-10 01:39:06,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:39:42,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:39:46,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:39:50,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:39:54,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:39:58,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:40:02,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:40:06,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:40:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:06,432 INFO L93 Difference]: Finished difference Result 176 states and 214 transitions. [2025-01-10 01:40:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:40:06,432 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 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-01-10 01:40:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:06,434 INFO L225 Difference]: With dead ends: 176 [2025-01-10 01:40:06,434 INFO L226 Difference]: Without dead ends: 175 [2025-01-10 01:40:06,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=197, Invalid=717, Unknown=16, NotChecked=0, Total=930 [2025-01-10 01:40:06,436 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 168 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:06,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 274 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 263 Invalid, 8 Unknown, 0 Unchecked, 32.5s Time] [2025-01-10 01:40:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-10 01:40:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 146. [2025-01-10 01:40:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.2013888888888888) internal successors, (173), 145 states have internal predecessors, (173), 0 states have call successors, (0), 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-01-10 01:40:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 173 transitions. [2025-01-10 01:40:06,449 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 173 transitions. Word has length 38 [2025-01-10 01:40:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:06,449 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 173 transitions. [2025-01-10 01:40:06,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 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-01-10 01:40:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 173 transitions. [2025-01-10 01:40:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 01:40:06,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:06,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:06,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:40:06,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:40:06,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:40:06,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1647714911, now seen corresponding path program 1 times [2025-01-10 01:40:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925525598] [2025-01-10 01:40:06,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:06,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 01:40:06,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:40:06,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:06,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:40:06,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021880553] [2025-01-10 01:40:06,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:06,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:06,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:06,774 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:40:06,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:40:06,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 01:40:06,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:40:06,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:06,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:06,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:40:06,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:40:07,142 INFO L312 TraceCheckSpWp]: Computing backward predicates...