./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/busybox-1.22.0/chroot-incomplete-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 787744388fd06e8efa619bb22a72aedc4b5bd63758f47071666035fc9da54e60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:24:35,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:24:36,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:24:36,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:24:36,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:24:36,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:24:36,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:24:36,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:24:36,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:24:36,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:24:36,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:24:36,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:24:36,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:24:36,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:24:36,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:24:36,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:36,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:24:36,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:24:36,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:24:36,062 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 787744388fd06e8efa619bb22a72aedc4b5bd63758f47071666035fc9da54e60 [2025-02-08 13:24:36,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:24:36,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:24:36,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:24:36,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:24:36,364 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:24:36,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-1.i [2025-02-08 13:24:37,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f05e2a964/3a7b52725a5d407b87da364773bc825c/FLAG8c8ef043a [2025-02-08 13:24:38,048 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:24:38,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-1.i [2025-02-08 13:24:38,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f05e2a964/3a7b52725a5d407b87da364773bc825c/FLAG8c8ef043a [2025-02-08 13:24:38,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f05e2a964/3a7b52725a5d407b87da364773bc825c [2025-02-08 13:24:38,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:24:38,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:24:38,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:38,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:24:38,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:24:38,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:38" (1/1) ... [2025-02-08 13:24:38,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3664ee54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:38, skipping insertion in model container [2025-02-08 13:24:38,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:38" (1/1) ... [2025-02-08 13:24:38,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:24:38,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:38,968 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:24:39,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:39,188 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:24:39,196 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:24:39,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39 WrapperNode [2025-02-08 13:24:39,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:39,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:39,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:24:39,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:24:39,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,300 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 1010 [2025-02-08 13:24:39,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:39,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:24:39,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:24:39,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:24:39,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,353 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:24:39,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:24:39,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:24:39,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:24:39,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:24:39,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:39,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:39,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:24:39,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:24:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2025-02-08 13:24:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:24:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:24:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-08 13:24:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-08 13:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:24:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:24:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:24:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:24:39,788 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:24:39,789 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:24:40,098 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2398: bb_verror_msg_#t~ret111#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet122#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret111#1 && bb_verror_msg_#t~ret111#1 <= 2147483647;havoc bb_verror_msg_#t~ret111#1;call bb_verror_msg_#t~mem112#1.base, bb_verror_msg_#t~mem112#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem112#1.base, bb_verror_msg_#t~mem112#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret123#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399: bb_verror_msg_#t~ret113#1 := full_write_#res#1;havoc full_write_#t~ret123#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret113#1 && bb_verror_msg_#t~ret113#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem112#1.base, bb_verror_msg_#t~mem112#1.offset;havoc bb_verror_msg_#t~ret113#1; [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet193#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet193#1;assume -9223372036854775808 <= write_#t~nondet193#1 && write_#t~nondet193#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet193#1;havoc write_#t~nondet193#1; [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !true; [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:24:40,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret133#1, safe_write_#t~mem134#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: safe_write_#t~ret133#1 := write_#res#1;havoc write_#t~nondet193#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret133#1 && safe_write_#t~ret133#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret133#1;havoc safe_write_#t~ret133#1; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437: full_write_#t~ret123#1 := safe_write_#res#1;havoc safe_write_#t~ret133#1, safe_write_#t~mem134#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret123#1 && full_write_#t~ret123#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret123#1;havoc full_write_#t~ret123#1; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: write_#res#1 := write_~ret~1#1; [2025-02-08 13:24:40,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:24:40,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem134#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem134#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:40,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:24:40,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume full_write_~cc~0#1 < 0; [2025-02-08 13:24:40,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:24:41,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579: havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset;get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset := bb_internal_getpwuid_#res#1.base, bb_internal_getpwuid_#res#1.offset;havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset, bb_internal_getpwuid_~uid#1;havoc bb_internal_getpwuid_#in~uid#1;assume { :end_inline_bb_internal_getpwuid } true;get_shell_name_~pw~0#1.base, get_shell_name_~pw~0#1.offset := get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset;havoc get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset; [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579-2: bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset := bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset;havoc bb_internal_getpwnam_#t~nondet157#1, bb_internal_getpwnam_#t~nondet158#1, bb_internal_getpwnam_#t~nondet159#1, bb_internal_getpwnam_~name#1.base, bb_internal_getpwnam_~name#1.offset;havoc bb_internal_getpwnam_#in~name#1.base, bb_internal_getpwnam_#in~name#1.offset;assume { :end_inline_bb_internal_getpwnam } true;bb_internal_getpwuid_#res#1.base, bb_internal_getpwuid_#res#1.offset := bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset;havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset; [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464: assume !(get_shell_name_#t~mem129#1.base == 0 && get_shell_name_#t~mem129#1.offset == 0);havoc get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset;call get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset := read~$Pointer$(get_shell_name_~pw~0#1.base, 40 + get_shell_name_~pw~0#1.offset, 8);call get_shell_name_#t~mem131#1 := read~int(get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset, 1); [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464: assume !!(get_shell_name_#t~mem129#1.base == 0 && get_shell_name_#t~mem129#1.offset == 0);havoc get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset; [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2419: __main_#t~ret120#1.base, __main_#t~ret120#1.offset := get_shell_name_#res#1.base, get_shell_name_#res#1.offset;havoc get_shell_name_#t~nondet124#1.base, get_shell_name_#t~nondet124#1.offset, get_shell_name_#t~nondet125#1, get_shell_name_#t~mem126#1, get_shell_name_#t~ret127#1, get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset, get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset, get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset, get_shell_name_#t~mem131#1, get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset, get_shell_name_~pw~0#1.base, get_shell_name_~pw~0#1.offset, get_shell_name_~shell~0#1.base, get_shell_name_~shell~0#1.offset, get_shell_name_~return_value_getuid$1~0#1;assume { :end_inline_get_shell_name } true;__main_~return_value_get_shell_name$1~0#1.base, __main_~return_value_get_shell_name$1~0#1.offset := __main_#t~ret120#1.base, __main_#t~ret120#1.offset;havoc __main_#t~ret120#1.base, __main_#t~ret120#1.offset;call write~$Pointer$(__main_~return_value_get_shell_name$1~0#1.base, __main_~return_value_get_shell_name$1~0#1.offset, __main_~argv#1.base, __main_~argv#1.offset, 8);call write~$Pointer$(7, 0, __main_~argv#1.base, 8 + __main_~argv#1.offset, 8);havoc __main_~return_value_get_shell_name$1~0#1.base, __main_~return_value_get_shell_name$1~0#1.offset; [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: assume 0 != bb_internal_getpwnam_#t~nondet159#1 % 4294967296;havoc bb_internal_getpwnam_#t~nondet159#1;bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset := 0, 0; [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: assume !(0 != bb_internal_getpwnam_#t~nondet159#1 % 4294967296);havoc bb_internal_getpwnam_#t~nondet159#1;bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset := ~#p~1.base, ~#p~1.offset; [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: havoc getuid_#t~nondet148#1;get_shell_name_#t~ret127#1 := getuid_#res#1;havoc getuid_#t~nondet148#1;assume { :end_inline_getuid } true;get_shell_name_~return_value_getuid$1~0#1 := get_shell_name_#t~ret127#1;havoc get_shell_name_#t~ret127#1;assume { :begin_inline_bb_internal_getpwuid } true;bb_internal_getpwuid_#in~uid#1 := get_shell_name_~return_value_getuid$1~0#1;havoc bb_internal_getpwuid_#res#1.base, bb_internal_getpwuid_#res#1.offset;havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset, bb_internal_getpwuid_~uid#1;bb_internal_getpwuid_~uid#1 := bb_internal_getpwuid_#in~uid#1;assume { :begin_inline_bb_internal_getpwnam } true;bb_internal_getpwnam_#in~name#1.base, bb_internal_getpwnam_#in~name#1.offset := 0, 0;havoc bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset;havoc bb_internal_getpwnam_#t~nondet157#1, bb_internal_getpwnam_#t~nondet158#1, bb_internal_getpwnam_#t~nondet159#1, bb_internal_getpwnam_~name#1.base, bb_internal_getpwnam_~name#1.offset;bb_internal_getpwnam_~name#1.base, bb_internal_getpwnam_~name#1.offset := bb_internal_getpwnam_#in~name#1.base, bb_internal_getpwnam_#in~name#1.offset;call write~$Pointer$(11, 0, ~#p~1.base, ~#p~1.offset, 8);call write~$Pointer$(12, 0, ~#p~1.base, 8 + ~#p~1.offset, 8);havoc bb_internal_getpwnam_#t~nondet157#1;call write~int(bb_internal_getpwnam_#t~nondet157#1, ~#p~1.base, 16 + ~#p~1.offset, 4);havoc bb_internal_getpwnam_#t~nondet157#1;havoc bb_internal_getpwnam_#t~nondet158#1;call write~int(bb_internal_getpwnam_#t~nondet158#1, ~#p~1.base, 20 + ~#p~1.offset, 4);havoc bb_internal_getpwnam_#t~nondet158#1;call write~$Pointer$(13, 0, ~#p~1.base, 24 + ~#p~1.offset, 8);call write~$Pointer$(14, 0, ~#p~1.base, 32 + ~#p~1.offset, 8);call write~$Pointer$(15, 0, ~#p~1.base, 40 + ~#p~1.offset, 8);havoc bb_internal_getpwnam_#t~nondet159#1; [2025-02-08 13:24:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc find_applet_by_name_#t~nondet78#1; [2025-02-08 13:24:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2470-1: get_shell_name_#res#1.base, get_shell_name_#res#1.offset := ~#bb_default_login_shell~0.base, 1 + ~#bb_default_login_shell~0.offset; [2025-02-08 13:24:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume !(0 == get_shell_name_#t~mem131#1);havoc get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset;havoc get_shell_name_#t~mem131#1;call get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset := read~$Pointer$(get_shell_name_~pw~0#1.base, 40 + get_shell_name_~pw~0#1.offset, 8);get_shell_name_#res#1.base, get_shell_name_#res#1.offset := get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset;havoc get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset; [2025-02-08 13:24:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume !!(0 == get_shell_name_#t~mem131#1);havoc get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset;havoc get_shell_name_#t~mem131#1; [2025-02-08 13:24:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !(get_shell_name_~pw~0#1.base == 0 && get_shell_name_~pw~0#1.offset == 0);call get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset := read~$Pointer$(get_shell_name_~pw~0#1.base, 40 + get_shell_name_~pw~0#1.offset, 8); [2025-02-08 13:24:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !!(get_shell_name_~pw~0#1.base == 0 && get_shell_name_~pw~0#1.offset == 0); [2025-02-08 13:24:41,325 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2025-02-08 13:24:41,325 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:24:41,336 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:24:41,336 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:24:41,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:24:41 BoogieIcfgContainer [2025-02-08 13:24:41,336 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:24:41,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:24:41,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:24:41,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:24:41,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:24:38" (1/3) ... [2025-02-08 13:24:41,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b8e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:24:41, skipping insertion in model container [2025-02-08 13:24:41,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39" (2/3) ... [2025-02-08 13:24:41,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b8e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:24:41, skipping insertion in model container [2025-02-08 13:24:41,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:24:41" (3/3) ... [2025-02-08 13:24:41,342 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-1.i [2025-02-08 13:24:41,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:24:41,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-1.i that has 5 procedures, 179 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-02-08 13:24:41,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:24:41,419 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;@15bd80be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:24:41,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-08 13:24:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 114 states have (on average 1.6842105263157894) internal successors, (192), 164 states have internal predecessors, (192), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:24:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:24:41,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:41,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:24:41,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:41,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 303826, now seen corresponding path program 1 times [2025-02-08 13:24:41,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365390110] [2025-02-08 13:24:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:41,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:41,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:24:41,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:24:41,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:41,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365390110] [2025-02-08 13:24:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365390110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:42,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:42,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:24:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073412788] [2025-02-08 13:24:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:42,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:42,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:42,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:42,035 INFO L87 Difference]: Start difference. First operand has 179 states, 114 states have (on average 1.6842105263157894) internal successors, (192), 164 states have internal predecessors, (192), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:24:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:42,084 INFO L93 Difference]: Finished difference Result 265 states and 331 transitions. [2025-02-08 13:24:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:24:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:42,092 INFO L225 Difference]: With dead ends: 265 [2025-02-08 13:24:42,092 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 13:24:42,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:42,099 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:42,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 13:24:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 13:24:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 67 states have internal predecessors, (75), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2025-02-08 13:24:42,129 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 3 [2025-02-08 13:24:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:42,130 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2025-02-08 13:24:42,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:24:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2025-02-08 13:24:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:24:42,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:42,131 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:24:42,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:24:42,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:42,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash 461585213, now seen corresponding path program 1 times [2025-02-08 13:24:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348065704] [2025-02-08 13:24:42,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:42,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:42,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:24:42,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:42,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:42,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:42,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348065704] [2025-02-08 13:24:42,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348065704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:42,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505430697] [2025-02-08 13:24:42,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:42,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:42,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:24:42,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:24:42,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:42,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:24:42,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:42,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:42,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:42,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:42,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505430697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:42,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:24:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8380557] [2025-02-08 13:24:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:42,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:24:42,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:42,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:24:42,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:42,882 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:24:43,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:24:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:44,017 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-02-08 13:24:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:24:44,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:24:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:44,018 INFO L225 Difference]: With dead ends: 75 [2025-02-08 13:24:44,018 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 13:24:44,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:44,018 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:44,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 13:24:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 13:24:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 13:24:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 66 states have internal predecessors, (74), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-02-08 13:24:44,023 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 6 [2025-02-08 13:24:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:44,023 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-02-08 13:24:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:24:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-02-08 13:24:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:24:44,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:44,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:24:44,035 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-02-08 13:24:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:44,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1424239956, now seen corresponding path program 1 times [2025-02-08 13:24:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991236383] [2025-02-08 13:24:44,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:44,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:24:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:24:44,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:44,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:24:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991236383] [2025-02-08 13:24:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991236383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703153741] [2025-02-08 13:24:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:44,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:44,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:44,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:44,433 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-02-08 13:24:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:44,458 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-02-08 13:24:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-08 13:24:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:44,459 INFO L225 Difference]: With dead ends: 74 [2025-02-08 13:24:44,459 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 13:24:44,459 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-02-08 13:24:44,460 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:44,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 13:24:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-02-08 13:24:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.392156862745098) internal successors, (71), 63 states have internal predecessors, (71), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-02-08 13:24:44,464 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 7 [2025-02-08 13:24:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:44,464 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-02-08 13:24:44,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:24:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-02-08 13:24:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:24:44,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:44,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:44,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:24:44,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:44,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -648775528, now seen corresponding path program 1 times [2025-02-08 13:24:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342345343] [2025-02-08 13:24:44,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:44,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:24:44,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:24:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:44,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342345343] [2025-02-08 13:24:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342345343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426327556] [2025-02-08 13:24:44,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:44,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:44,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:44,728 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-02-08 13:24:44,733 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-02-08 13:24:44,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:24:45,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:24:45,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:45,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:24:45,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:24:45,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426327556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:45,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:45,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:24:45,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701368226] [2025-02-08 13:24:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:45,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:45,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:45,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:45,119 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:45,729 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-02-08 13:24:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:45,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:24:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:45,730 INFO L225 Difference]: With dead ends: 71 [2025-02-08 13:24:45,730 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 13:24:45,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-02-08 13:24:45,731 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:45,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:24:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 13:24:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 13:24:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 61 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-02-08 13:24:45,735 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2025-02-08 13:24:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:45,736 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-02-08 13:24:45,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-02-08 13:24:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:24:45,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:45,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:45,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:24:45,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:45,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:45,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1362795347, now seen corresponding path program 1 times [2025-02-08 13:24:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:45,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139940029] [2025-02-08 13:24:45,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:46,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:24:46,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:24:46,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:46,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:46,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:46,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139940029] [2025-02-08 13:24:46,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139940029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:46,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23782405] [2025-02-08 13:24:46,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:46,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:46,152 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-02-08 13:24:46,153 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-02-08 13:24:46,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:24:46,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:24:46,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:46,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:46,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:46,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:46,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:24:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23782405] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:24:46,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:24:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:24:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805079307] [2025-02-08 13:24:46,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:24:46,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:24:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:46,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:24:46,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:46,520 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:24:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:46,550 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2025-02-08 13:24:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:24:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:24:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:46,554 INFO L225 Difference]: With dead ends: 142 [2025-02-08 13:24:46,554 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 13:24:46,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:46,555 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:46,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 298 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 13:24:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-08 13:24:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3) internal successors, (78), 70 states have internal predecessors, (78), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-02-08 13:24:46,567 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 12 [2025-02-08 13:24:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:46,567 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-02-08 13:24:46,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:24:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-02-08 13:24:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:24:46,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:46,567 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:46,587 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-02-08 13:24:46,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:46,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:46,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash -521289880, now seen corresponding path program 2 times [2025-02-08 13:24:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:46,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699124277] [2025-02-08 13:24:46,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:24:46,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:46,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:24:46,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:24:46,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:24:46,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:24:47,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:47,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699124277] [2025-02-08 13:24:47,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699124277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:47,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:47,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:24:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805633925] [2025-02-08 13:24:47,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:47,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:24:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:47,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:24:47,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:47,180 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:48,208 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2025-02-08 13:24:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:24:48,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:24:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:48,209 INFO L225 Difference]: With dead ends: 78 [2025-02-08 13:24:48,209 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 13:24:48,209 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-02-08 13:24:48,210 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:48,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 234 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 13:24:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 13:24:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-08 13:24:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 68 states have internal predecessors, (76), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-02-08 13:24:48,214 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 21 [2025-02-08 13:24:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:48,214 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-02-08 13:24:48,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-02-08 13:24:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:24:48,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:48,214 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:48,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:24:48,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1468629950, now seen corresponding path program 1 times [2025-02-08 13:24:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471567753] [2025-02-08 13:24:48,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:48,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:24:48,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:24:48,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:48,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:24:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471567753] [2025-02-08 13:24:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471567753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961718869] [2025-02-08 13:24:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:48,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:48,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:48,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:48,443 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:49,135 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2025-02-08 13:24:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:49,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:24:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:49,136 INFO L225 Difference]: With dead ends: 136 [2025-02-08 13:24:49,136 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 13:24:49,136 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-02-08 13:24:49,136 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:49,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 143 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 13:24:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 13:24:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 13:24:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.253968253968254) internal successors, (79), 71 states have internal predecessors, (79), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2025-02-08 13:24:49,141 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 26 [2025-02-08 13:24:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:49,141 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2025-02-08 13:24:49,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2025-02-08 13:24:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:24:49,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:49,146 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:49,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:24:49,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:49,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash -876780351, now seen corresponding path program 1 times [2025-02-08 13:24:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608800650] [2025-02-08 13:24:49,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:49,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:24:49,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:24:49,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:49,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:24:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608800650] [2025-02-08 13:24:49,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608800650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280748813] [2025-02-08 13:24:49,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:49,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:49,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:49,435 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-02-08 13:24:49,436 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-02-08 13:24:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:24:49,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:24:49,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:49,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:49,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:24:49,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:24:49,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:24:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:24:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280748813] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:24:49,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:24:49,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:24:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652145561] [2025-02-08 13:24:49,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:24:49,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:24:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:49,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:24:49,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:24:49,930 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:24:51,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:24:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:52,201 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2025-02-08 13:24:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:24:52,201 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:24:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:52,202 INFO L225 Difference]: With dead ends: 161 [2025-02-08 13:24:52,202 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 13:24:52,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:24:52,202 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:52,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 398 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 13:24:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 13:24:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 13:24:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 88 states have internal predecessors, (96), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-02-08 13:24:52,210 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 29 [2025-02-08 13:24:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:52,210 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-02-08 13:24:52,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:24:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-02-08 13:24:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:24:52,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:52,213 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:52,223 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-02-08 13:24:52,414 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,SelfDestructingSolverStorable7 [2025-02-08 13:24:52,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:52,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2082656385, now seen corresponding path program 1 times [2025-02-08 13:24:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783526251] [2025-02-08 13:24:52,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:52,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:52,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:24:52,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:24:52,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:52,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:24:52,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783526251] [2025-02-08 13:24:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783526251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363110044] [2025-02-08 13:24:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:52,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:52,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:52,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:52,625 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:53,266 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2025-02-08 13:24:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:24:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:53,267 INFO L225 Difference]: With dead ends: 108 [2025-02-08 13:24:53,267 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 13:24:53,267 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-02-08 13:24:53,267 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:53,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 138 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:24:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 13:24:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-08 13:24:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2) internal successors, (108), 97 states have internal predecessors, (108), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2025-02-08 13:24:53,273 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 47 [2025-02-08 13:24:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:53,273 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2025-02-08 13:24:53,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2025-02-08 13:24:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:24:53,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:53,278 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:53,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:24:53,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 137843680, now seen corresponding path program 1 times [2025-02-08 13:24:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202361006] [2025-02-08 13:24:53,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:53,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:24:53,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:24:53,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:53,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:24:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202361006] [2025-02-08 13:24:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202361006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227979115] [2025-02-08 13:24:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:53,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:53,506 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:54,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:24:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:54,636 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2025-02-08 13:24:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:24:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:54,638 INFO L225 Difference]: With dead ends: 105 [2025-02-08 13:24:54,638 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 13:24:54,638 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-02-08 13:24:54,638 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:54,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 13:24:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 13:24:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-02-08 13:24:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-02-08 13:24:54,647 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 48 [2025-02-08 13:24:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:54,647 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-02-08 13:24:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-02-08 13:24:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:24:54,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:54,647 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:54,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:24:54,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_perror_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:54,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1949160248, now seen corresponding path program 1 times [2025-02-08 13:24:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:54,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449094978] [2025-02-08 13:24:54,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:54,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:54,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:24:54,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:24:54,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:54,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:24:54,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:54,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449094978] [2025-02-08 13:24:54,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449094978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:54,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:54,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:24:54,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883398903] [2025-02-08 13:24:54,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:54,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:54,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:54,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:54,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:54,861 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:54,874 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2025-02-08 13:24:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:24:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:54,875 INFO L225 Difference]: With dead ends: 111 [2025-02-08 13:24:54,875 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 13:24:54,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:54,875 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:54,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 13:24:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 13:24:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-02-08 13:24:54,879 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 54 [2025-02-08 13:24:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:54,879 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-02-08 13:24:54,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-02-08 13:24:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:24:54,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:54,880 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:54,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:24:54,880 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:54,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1374025302, now seen corresponding path program 1 times [2025-02-08 13:24:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:54,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418683559] [2025-02-08 13:24:54,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:54,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:24:54,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:24:54,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:54,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:24:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418683559] [2025-02-08 13:24:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418683559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774186587] [2025-02-08 13:24:55,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:55,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:55,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:55,107 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-02-08 13:24:55,109 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-02-08 13:24:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:24:55,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:24:55,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:55,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:55,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:55,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:24:55,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:24:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:24:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774186587] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:24:55,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:24:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:24:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068565287] [2025-02-08 13:24:55,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:24:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:24:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:24:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:55,568 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:58,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:24:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:58,046 INFO L93 Difference]: Finished difference Result 174 states and 200 transitions. [2025-02-08 13:24:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:24:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:24:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:58,047 INFO L225 Difference]: With dead ends: 174 [2025-02-08 13:24:58,047 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 13:24:58,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:58,050 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:58,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 271 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 13:24:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 13:24:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-08 13:24:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 109 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2025-02-08 13:24:58,057 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 54 [2025-02-08 13:24:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:58,058 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2025-02-08 13:24:58,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2025-02-08 13:24:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 13:24:58,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:58,058 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:58,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:24:58,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 13:24:58,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_perror_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:58,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -425384068, now seen corresponding path program 1 times [2025-02-08 13:24:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:58,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612627811] [2025-02-08 13:24:58,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:58,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:58,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:24:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:24:58,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:58,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:24:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:58,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612627811] [2025-02-08 13:24:58,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612627811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:58,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:58,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:24:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026203769] [2025-02-08 13:24:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:58,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:24:58,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:58,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:24:58,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:58,599 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:58,625 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2025-02-08 13:24:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:24:58,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 13:24:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:58,627 INFO L225 Difference]: With dead ends: 132 [2025-02-08 13:24:58,627 INFO L226 Difference]: Without dead ends: 128 [2025-02-08 13:24:58,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:58,627 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 20 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 276 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-02-08 13:24:58,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 276 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-08 13:24:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-02-08 13:24:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2025-02-08 13:24:58,635 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 57 [2025-02-08 13:24:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:58,635 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2025-02-08 13:24:58,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2025-02-08 13:24:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 13:24:58,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:58,637 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:58,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:24:58,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_perror_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:58,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash -425354277, now seen corresponding path program 1 times [2025-02-08 13:24:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869831102] [2025-02-08 13:24:58,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:58,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:24:58,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:24:58,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:58,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:24:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869831102] [2025-02-08 13:24:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869831102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:24:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224777503] [2025-02-08 13:24:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:58,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:58,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:58,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:58,979 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:58,988 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2025-02-08 13:24:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:58,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 13:24:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:58,989 INFO L225 Difference]: With dead ends: 128 [2025-02-08 13:24:58,990 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 13:24:58,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:58,991 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:58,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 13:24:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-08 13:24:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.1346153846153846) internal successors, (118), 108 states have internal predecessors, (118), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-02-08 13:24:58,997 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 57 [2025-02-08 13:24:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:58,997 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-02-08 13:24:58,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-02-08 13:24:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 13:24:58,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:58,999 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:58,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:24:58,999 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:59,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1198137064, now seen corresponding path program 1 times [2025-02-08 13:24:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:59,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853445124] [2025-02-08 13:24:59,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:59,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:24:59,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:24:59,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:59,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:24:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853445124] [2025-02-08 13:24:59,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853445124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:59,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:59,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:59,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489295774] [2025-02-08 13:24:59,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:59,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:59,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:59,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:59,204 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:59,215 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2025-02-08 13:24:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:59,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-02-08 13:24:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:59,217 INFO L225 Difference]: With dead ends: 128 [2025-02-08 13:24:59,217 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 13:24:59,217 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-02-08 13:24:59,218 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:59,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 133 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 13:24:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-02-08 13:24:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 112 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2025-02-08 13:24:59,222 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 58 [2025-02-08 13:24:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:59,222 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2025-02-08 13:24:59,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2025-02-08 13:24:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:24:59,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:59,223 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:59,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:24:59,223 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:24:59,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash 904246316, now seen corresponding path program 1 times [2025-02-08 13:24:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791794058] [2025-02-08 13:24:59,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:59,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 13:24:59,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 13:24:59,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:59,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:24:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791794058] [2025-02-08 13:24:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791794058] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728418983] [2025-02-08 13:24:59,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:59,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:59,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:59,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:24:59,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:24:59,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 13:24:59,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 13:24:59,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:59,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:59,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:59,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:24:59,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728418983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:59,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:24:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761241954] [2025-02-08 13:24:59,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:59,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:24:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:59,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:24:59,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:59,941 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:59,955 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2025-02-08 13:24:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:24:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-08 13:24:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:59,957 INFO L225 Difference]: With dead ends: 126 [2025-02-08 13:24:59,957 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 13:24:59,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:59,957 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:59,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 198 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 13:24:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-02-08 13:24:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 111 states have internal predecessors, (122), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:24:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2025-02-08 13:24:59,961 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 62 [2025-02-08 13:24:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:59,962 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2025-02-08 13:24:59,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:24:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2025-02-08 13:24:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 13:24:59,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:59,962 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:59,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:00,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 13:25:00,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:00,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2033135299, now seen corresponding path program 1 times [2025-02-08 13:25:00,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:00,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024302338] [2025-02-08 13:25:00,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:00,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 13:25:00,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 13:25:00,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:00,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024302338] [2025-02-08 13:25:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024302338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333825021] [2025-02-08 13:25:00,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:00,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:00,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:00,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:00,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:25:00,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 13:25:00,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 13:25:00,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:00,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:00,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:00,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:00,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:00,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333825021] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:00,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:25:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473289320] [2025-02-08 13:25:00,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:00,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:00,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:00,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:00,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:00,939 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:00,989 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2025-02-08 13:25:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:00,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-08 13:25:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:00,990 INFO L225 Difference]: With dead ends: 156 [2025-02-08 13:25:00,990 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 13:25:00,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:00,990 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 39 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 160 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-02-08 13:25:00,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 160 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 13:25:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2025-02-08 13:25:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 120 states have (on average 1.1416666666666666) internal successors, (137), 123 states have internal predecessors, (137), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:25:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2025-02-08 13:25:01,000 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 63 [2025-02-08 13:25:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:01,000 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2025-02-08 13:25:01,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2025-02-08 13:25:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 13:25:01,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:01,003 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:01,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:25:01,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:01,204 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:01,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash 419068230, now seen corresponding path program 2 times [2025-02-08 13:25:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:01,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114496126] [2025-02-08 13:25:01,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:01,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:25:01,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 13:25:01,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:25:01,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-08 13:25:01,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114496126] [2025-02-08 13:25:01,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114496126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77805051] [2025-02-08 13:25:01,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:01,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:01,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:01,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:01,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:25:01,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:25:04,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 13:25:04,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:25:04,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:04,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:25:04,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-08 13:25:04,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-08 13:25:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77805051] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:04,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:04,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-08 13:25:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256250639] [2025-02-08 13:25:04,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:04,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:25:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:04,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:25:04,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:25:04,410 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:07,711 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2025-02-08 13:25:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 13:25:07,712 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2025-02-08 13:25:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:07,713 INFO L225 Difference]: With dead ends: 246 [2025-02-08 13:25:07,713 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 13:25:07,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 13:25:07,714 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:07,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 357 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-08 13:25:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 13:25:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-08 13:25:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 156 states have (on average 1.1025641025641026) internal successors, (172), 158 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:25:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2025-02-08 13:25:07,719 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 72 [2025-02-08 13:25:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:07,720 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2025-02-08 13:25:07,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2025-02-08 13:25:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 13:25:07,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:07,721 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:07,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:07,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:25:07,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1204152591, now seen corresponding path program 2 times [2025-02-08 13:25:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379417354] [2025-02-08 13:25:07,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:08,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-08 13:25:08,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 75 statements. [2025-02-08 13:25:08,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:25:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:25:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379417354] [2025-02-08 13:25:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379417354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:08,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:08,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:25:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386476128] [2025-02-08 13:25:08,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:25:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:08,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:25:08,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:25:08,222 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:10,144 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2025-02-08 13:25:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-02-08 13:25:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:10,145 INFO L225 Difference]: With dead ends: 226 [2025-02-08 13:25:10,145 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 13:25:10,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-08 13:25:10,146 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:10,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 250 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 13:25:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 13:25:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-08 13:25:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 156 states have (on average 1.0961538461538463) internal successors, (171), 158 states have internal predecessors, (171), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:25:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2025-02-08 13:25:10,151 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 75 [2025-02-08 13:25:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2025-02-08 13:25:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2025-02-08 13:25:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 13:25:10,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:10,153 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:25:10,153 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1473848759, now seen corresponding path program 1 times [2025-02-08 13:25:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72605894] [2025-02-08 13:25:10,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:10,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:10,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:10,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:10,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:25:10,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:10,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72605894] [2025-02-08 13:25:10,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72605894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:10,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995083494] [2025-02-08 13:25:10,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:10,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:10,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:10,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:10,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:25:10,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:11,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:11,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:11,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:11,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1886 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:25:11,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:25:11,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:25:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995083494] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:11,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-08 13:25:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920523400] [2025-02-08 13:25:11,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:11,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:25:11,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:11,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:25:11,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:25:11,202 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 13 states, 12 states have (on average 6.5) internal successors, (78), 13 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:11,255 INFO L93 Difference]: Finished difference Result 251 states and 296 transitions. [2025-02-08 13:25:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:25:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.5) internal successors, (78), 13 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2025-02-08 13:25:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:11,257 INFO L225 Difference]: With dead ends: 251 [2025-02-08 13:25:11,257 INFO L226 Difference]: Without dead ends: 250 [2025-02-08 13:25:11,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:25:11,257 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 82 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:11,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 383 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-08 13:25:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2025-02-08 13:25:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 180 states have (on average 1.1166666666666667) internal successors, (201), 182 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:25:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2025-02-08 13:25:11,264 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 109 [2025-02-08 13:25:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:11,265 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2025-02-08 13:25:11,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.5) internal successors, (78), 13 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2025-02-08 13:25:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 13:25:11,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:11,265 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:11,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:25:11,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:11,466 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting bb_perror_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:11,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash -94368399, now seen corresponding path program 1 times [2025-02-08 13:25:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648518312] [2025-02-08 13:25:11,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:11,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:11,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 13:25:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 13:25:11,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:11,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-02-08 13:25:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648518312] [2025-02-08 13:25:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648518312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:11,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:25:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491803474] [2025-02-08 13:25:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:11,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:25:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:11,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:25:11,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:11,802 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 13:25:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:11,819 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2025-02-08 13:25:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:25:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 112 [2025-02-08 13:25:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:11,820 INFO L225 Difference]: With dead ends: 194 [2025-02-08 13:25:11,821 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 13:25:11,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:11,821 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 20 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:11,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 239 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 13:25:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-02-08 13:25:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 180 states have (on average 1.1111111111111112) internal successors, (200), 182 states have internal predecessors, (200), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:25:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2025-02-08 13:25:11,826 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 112 [2025-02-08 13:25:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:11,827 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2025-02-08 13:25:11,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 13:25:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2025-02-08 13:25:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 13:25:11,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:11,828 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:11,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 13:25:11,828 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_perror_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -94338608, now seen corresponding path program 1 times [2025-02-08 13:25:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431973816] [2025-02-08 13:25:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:11,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 13:25:12,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 13:25:12,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:12,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:25:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431973816] [2025-02-08 13:25:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431973816] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483411320] [2025-02-08 13:25:14,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:14,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:14,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:14,040 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:14,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:25:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 13:25:14,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 13:25:14,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:14,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:14,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 13:25:14,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-02-08 13:25:14,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:14,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483411320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:14,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:14,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2025-02-08 13:25:14,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189255781] [2025-02-08 13:25:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:14,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:25:14,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:14,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:25:14,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2025-02-08 13:25:14,911 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:25:18,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:18,567 INFO L93 Difference]: Finished difference Result 278 states and 312 transitions. [2025-02-08 13:25:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:25:18,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 112 [2025-02-08 13:25:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:18,569 INFO L225 Difference]: With dead ends: 278 [2025-02-08 13:25:18,569 INFO L226 Difference]: Without dead ends: 206 [2025-02-08 13:25:18,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2025-02-08 13:25:18,571 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:18,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-08 13:25:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-08 13:25:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2025-02-08 13:25:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 185 states have (on average 1.1081081081081081) internal successors, (205), 189 states have internal predecessors, (205), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 13:25:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2025-02-08 13:25:18,577 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 112 [2025-02-08 13:25:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:18,578 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2025-02-08 13:25:18,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:25:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2025-02-08 13:25:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 13:25:18,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:18,578 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:18,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 13:25:18,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:18,783 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:18,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1172288406, now seen corresponding path program 1 times [2025-02-08 13:25:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:18,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317775734] [2025-02-08 13:25:18,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:18,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:18,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:18,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-08 13:25:19,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:19,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317775734] [2025-02-08 13:25:19,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317775734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:19,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919384633] [2025-02-08 13:25:19,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:19,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:19,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:19,100 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:19,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 13:25:19,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:19,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:19,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:19,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:19,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:19,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-08 13:25:19,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-08 13:25:19,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919384633] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:19,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:25:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367960557] [2025-02-08 13:25:19,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:19,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:19,947 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:21,285 INFO L93 Difference]: Finished difference Result 301 states and 330 transitions. [2025-02-08 13:25:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:21,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2025-02-08 13:25:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:21,287 INFO L225 Difference]: With dead ends: 301 [2025-02-08 13:25:21,287 INFO L226 Difference]: Without dead ends: 300 [2025-02-08 13:25:21,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:21,287 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:21,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 13:25:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-08 13:25:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-02-08 13:25:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 287 states have (on average 1.0905923344947734) internal successors, (313), 291 states have internal predecessors, (313), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 13:25:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 327 transitions. [2025-02-08 13:25:21,301 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 327 transitions. Word has length 109 [2025-02-08 13:25:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:21,301 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 327 transitions. [2025-02-08 13:25:21,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 327 transitions. [2025-02-08 13:25:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 13:25:21,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:21,305 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:21,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:21,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 13:25:21,510 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting bb_perror_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:21,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1686845940, now seen corresponding path program 1 times [2025-02-08 13:25:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847840106] [2025-02-08 13:25:21,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:21,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:21,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 13:25:21,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 13:25:21,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:21,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-02-08 13:25:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847840106] [2025-02-08 13:25:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847840106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139271581] [2025-02-08 13:25:23,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:23,673 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:23,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 13:25:24,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 13:25:24,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 13:25:24,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:24,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:24,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 13:25:24,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:24,414 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:24,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 13:25:24,619 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:24,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 13:25:24,637 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 13:25:24,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 13:25:24,694 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:24,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 13:25:24,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 13:25:25,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-02-08 13:25:25,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-08 13:25:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-02-08 13:25:25,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:25,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139271581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:25,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:25,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2025-02-08 13:25:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461615570] [2025-02-08 13:25:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:25,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:25:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:25,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:25:25,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-02-08 13:25:25,131 INFO L87 Difference]: Start difference. First operand 300 states and 327 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:25:26,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:28,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:30,317 INFO L93 Difference]: Finished difference Result 357 states and 394 transitions. [2025-02-08 13:25:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:25:30,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2025-02-08 13:25:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:30,320 INFO L225 Difference]: With dead ends: 357 [2025-02-08 13:25:30,320 INFO L226 Difference]: Without dead ends: 348 [2025-02-08 13:25:30,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-02-08 13:25:30,321 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:30,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 345 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-08 13:25:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-08 13:25:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2025-02-08 13:25:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 290 states have (on average 1.0862068965517242) internal successors, (315), 293 states have internal predecessors, (315), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 13:25:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 329 transitions. [2025-02-08 13:25:30,332 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 329 transitions. Word has length 116 [2025-02-08 13:25:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:30,332 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 329 transitions. [2025-02-08 13:25:30,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:25:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 329 transitions. [2025-02-08 13:25:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-08 13:25:30,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:30,334 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:30,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:30,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:30,538 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting bb_perror_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-08 13:25:30,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1036067946, now seen corresponding path program 1 times [2025-02-08 13:25:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297436518] [2025-02-08 13:25:30,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:30,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 13:25:30,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 13:25:30,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:30,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-02-08 13:25:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297436518] [2025-02-08 13:25:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297436518] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495098933] [2025-02-08 13:25:35,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:35,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:35,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:35,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:35,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 13:25:35,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 13:25:35,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 13:25:35,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:35,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:35,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-08 13:25:35,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:35,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 13:25:35,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 13:25:35,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 13:25:36,008 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:36,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 13:25:36,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:36,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:36,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2025-02-08 13:25:36,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:36,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2025-02-08 13:25:36,080 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2025-02-08 13:25:36,137 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:36,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2025-02-08 13:25:36,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:36,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 13:25:36,161 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 13:25:36,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-08 13:25:36,205 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,252 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,302 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,350 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,397 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,447 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,545 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,591 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,642 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:25:36,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-08 13:25:36,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 13:25:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-02-08 13:25:36,785 INFO L312 TraceCheckSpWp]: Computing backward predicates...