./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.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-2.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 ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:24:36,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:24:36,102 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,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:24:36,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:24:36,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:24:36,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:24:36,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:24:36,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:24:36,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:24:36,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:24:36,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:24:36,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:24:36,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:24:36,133 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:24:36,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:24:36,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:24:36,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:24:36,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:24:36,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:24:36,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:24:36,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:24:36,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:24:36,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:36,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:24:36,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:24:36,136 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 -> ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a [2025-02-08 13:24:36,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:24:36,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:24:36,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:24:36,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:24:36,372 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:24:36,373 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-2.i [2025-02-08 13:24:37,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053a798e5/b1f24785d0b04f61953157c3f367bf0f/FLAGb79e78757 [2025-02-08 13:24:38,011 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:24:38,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-02-08 13:24:38,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053a798e5/b1f24785d0b04f61953157c3f367bf0f/FLAGb79e78757 [2025-02-08 13:24:38,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053a798e5/b1f24785d0b04f61953157c3f367bf0f [2025-02-08 13:24:38,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:24:38,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:24:38,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:38,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:24:38,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:24:38,075 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,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169ff71b 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,077 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,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:24:38,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:38,817 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:24:38,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:39,014 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:24:39,022 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:24:39,022 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,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:39,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:39,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:24:39,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:24:39,028 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,057 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,098 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 1002 [2025-02-08 13:24:39,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:39,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:24:39,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:24:39,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:24:39,108 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,108 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,122 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,146 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:24:39,147 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,148 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,174 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,176 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,180 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,182 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,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:24:39,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:24:39,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:24:39,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:24:39,193 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,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:39,223 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,227 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,241 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2025-02-08 13:24:39,241 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2025-02-08 13:24:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:24:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:24:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:24:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:24:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:24:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:24:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:24:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:24:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-08 13:24:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:24:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:24:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:24:39,524 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:24:39,526 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:24:39,845 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:39,846 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:39,846 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:39,846 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:39,847 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:39,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !true; [2025-02-08 13:24:39,847 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:39,847 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:39,847 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:39,847 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:39,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:24:39,847 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:39,847 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:39,848 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:39,848 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:39,848 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:39,848 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:39,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: write_#res#1 := write_~ret~1#1; [2025-02-08 13:24:39,848 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:39,848 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:39,848 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:39,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume full_write_~cc~0#1 < 0; [2025-02-08 13:24:39,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:24:41,085 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,085 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,085 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,085 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,085 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,085 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,085 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,085 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,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc find_applet_by_name_#t~nondet78#1; [2025-02-08 13:24:41,086 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,086 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,086 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,086 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,086 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,141 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2025-02-08 13:24:41,141 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:24:41,158 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:24:41,158 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:24:41,158 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,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:24:41,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:24:41,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:24:41,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:24:41,179 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,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714cd4eb 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,180 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,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714cd4eb 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,181 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,182 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2025-02-08 13:24:41,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:24:41,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-2.i that has 5 procedures, 163 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-02-08 13:24:41,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:24:41,239 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;@685eed8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:24:41,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-02-08 13:24:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 106 states have (on average 1.6603773584905661) internal successors, (176), 148 states have internal predecessors, (176), 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,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:24:41,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:41,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:24:41,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 287938, now seen corresponding path program 1 times [2025-02-08 13:24:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2183115] [2025-02-08 13:24:41,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:41,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:24:41,637 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,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:41,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:41,904 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:41,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:41,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2183115] [2025-02-08 13:24:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2183115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:41,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:24:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979676822] [2025-02-08 13:24:41,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:41,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:41,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:41,924 INFO L87 Difference]: Start difference. First operand has 163 states, 106 states have (on average 1.6603773584905661) internal successors, (176), 148 states have internal predecessors, (176), 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:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:41,980 INFO L93 Difference]: Finished difference Result 249 states and 315 transitions. [2025-02-08 13:24:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:41,985 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:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:41,990 INFO L225 Difference]: With dead ends: 249 [2025-02-08 13:24:41,991 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 13:24:41,996 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:41,998 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,001 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,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 13:24:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 13:24:42,027 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,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2025-02-08 13:24:42,034 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 3 [2025-02-08 13:24:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:42,035 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2025-02-08 13:24:42,035 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,035 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2025-02-08 13:24:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:24:42,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:42,036 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:24:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:24:42,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash -11750083, now seen corresponding path program 1 times [2025-02-08 13:24:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974829959] [2025-02-08 13:24:42,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:42,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:42,215 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,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:42,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:42,358 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,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974829959] [2025-02-08 13:24:42,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974829959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105683177] [2025-02-08 13:24:42,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:42,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:42,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:42,361 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,362 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,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:42,760 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,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:42,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:42,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:42,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:42,789 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,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:42,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105683177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:42,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:42,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:24:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597001088] [2025-02-08 13:24:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:42,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:24:42,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:42,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:24:42,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:42,791 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,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:43,734 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-02-08 13:24:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:24:43,735 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:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:43,736 INFO L225 Difference]: With dead ends: 75 [2025-02-08 13:24:43,737 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 13:24:43,737 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:43,738 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:43,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 13:24:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 13:24:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 13:24:43,745 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:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-02-08 13:24:43,747 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 6 [2025-02-08 13:24:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:43,747 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-02-08 13:24:43,747 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:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-02-08 13:24:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:24:43,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:43,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:24:43,757 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:43,952 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:43,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:43,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash -364252348, now seen corresponding path program 1 times [2025-02-08 13:24:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:43,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076986744] [2025-02-08 13:24:43,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:44,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:24:44,133 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,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:44,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:44,249 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,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076986744] [2025-02-08 13:24:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076986744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:44,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970395632] [2025-02-08 13:24:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:44,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:44,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:44,250 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,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:44,277 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-02-08 13:24:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:44,278 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,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:44,280 INFO L225 Difference]: With dead ends: 74 [2025-02-08 13:24:44,280 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 13:24:44,281 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,281 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,282 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,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 13:24:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-02-08 13:24:44,287 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,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-02-08 13:24:44,288 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 7 [2025-02-08 13:24:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:44,288 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-02-08 13:24:44,288 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,288 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-02-08 13:24:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:24:44,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:44,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:24:44,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash 442973336, now seen corresponding path program 1 times [2025-02-08 13:24:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954533900] [2025-02-08 13:24:44,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:44,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:24:44,417 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,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:44,601 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,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954533900] [2025-02-08 13:24:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954533900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035636384] [2025-02-08 13:24:44,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:44,604 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,606 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,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:24:44,975 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,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:44,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:44,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:24:44,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:44,991 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:44,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:44,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035636384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:44,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:24:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404257531] [2025-02-08 13:24:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:44,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:44,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:44,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:44,993 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,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:45,781 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-02-08 13:24:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:45,788 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,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:45,790 INFO L225 Difference]: With dead ends: 71 [2025-02-08 13:24:45,790 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 13:24:45,790 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,791 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:45,791 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.8s Time] [2025-02-08 13:24:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 13:24:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 13:24:45,794 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,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-02-08 13:24:45,795 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2025-02-08 13:24:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:45,796 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-02-08 13:24:45,796 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,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-02-08 13:24:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:24:45,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:45,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:45,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:24:45,997 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,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:45,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash 847271747, now seen corresponding path program 1 times [2025-02-08 13:24:45,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852232578] [2025-02-08 13:24:45,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:45,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:46,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:24:46,144 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,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:46,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:46,256 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,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852232578] [2025-02-08 13:24:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852232578] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122738859] [2025-02-08 13:24:46,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:46,259 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,261 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,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:24:46,638 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,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:46,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:46,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:46,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:46,655 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,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:24:46,679 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,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122738859] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:24:46,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:24:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:24:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491818613] [2025-02-08 13:24:46,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:24:46,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:24:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:46,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:24:46,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:46,681 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,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:46,703 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2025-02-08 13:24:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:24:46,704 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,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:46,705 INFO L225 Difference]: With dead ends: 142 [2025-02-08 13:24:46,705 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 13:24:46,705 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,705 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:46,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 224 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 13:24:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-08 13:24:46,709 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,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-02-08 13:24:46,710 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 12 [2025-02-08 13:24:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:46,710 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-02-08 13:24:46,710 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,710 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-02-08 13:24:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:24:46,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:46,711 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:46,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:24:46,911 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,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:46,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1824318648, now seen corresponding path program 2 times [2025-02-08 13:24:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486880334] [2025-02-08 13:24:46,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:24:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:47,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:24:47,071 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:47,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:24:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:47,269 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,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:47,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486880334] [2025-02-08 13:24:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486880334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:24:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954352420] [2025-02-08 13:24:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:47,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:24:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:47,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:24:47,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:47,271 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,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:48,088 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2025-02-08 13:24:48,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:24:48,089 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,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:48,089 INFO L225 Difference]: With dead ends: 78 [2025-02-08 13:24:48,089 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 13:24:48,090 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,090 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:48,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 234 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 13:24:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 13:24:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-08 13:24:48,093 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,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-02-08 13:24:48,094 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 21 [2025-02-08 13:24:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:48,094 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-02-08 13:24:48,094 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,094 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-02-08 13:24:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:24:48,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:48,095 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,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:24:48,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1733716018, now seen corresponding path program 1 times [2025-02-08 13:24:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:48,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570774149] [2025-02-08 13:24:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:48,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:24:48,227 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,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:48,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:48,343 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,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570774149] [2025-02-08 13:24:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570774149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:48,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:48,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443827321] [2025-02-08 13:24:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:48,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:48,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:48,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:48,344 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,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:49,100 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2025-02-08 13:24:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:49,101 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,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:49,101 INFO L225 Difference]: With dead ends: 136 [2025-02-08 13:24:49,101 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 13:24:49,101 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,103 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.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:49,103 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.8s Time] [2025-02-08 13:24:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 13:24:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 13:24:49,107 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,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2025-02-08 13:24:49,107 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 26 [2025-02-08 13:24:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:49,107 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2025-02-08 13:24:49,107 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,107 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2025-02-08 13:24:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:24:49,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:49,108 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,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:24:49,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:49,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2143017121, now seen corresponding path program 1 times [2025-02-08 13:24:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519350110] [2025-02-08 13:24:49,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:49,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:24:49,231 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,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:49,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:49,340 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,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519350110] [2025-02-08 13:24:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519350110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919080930] [2025-02-08 13:24:49,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:49,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:49,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:49,342 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,344 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,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:24:49,755 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,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:49,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:49,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:24:49,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:49,809 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,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:24:49,891 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,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919080930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:24:49,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:24:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:24:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195769735] [2025-02-08 13:24:49,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:24:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:24:49,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:49,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:24:49,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:24:49,892 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,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:24:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:52,129 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2025-02-08 13:24:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:24:52,130 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,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:52,131 INFO L225 Difference]: With dead ends: 161 [2025-02-08 13:24:52,131 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 13:24:52,131 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,132 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:52,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 464 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 13:24:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 13:24:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 13:24:52,136 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,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-02-08 13:24:52,136 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 29 [2025-02-08 13:24:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:52,137 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-02-08 13:24:52,137 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,137 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-02-08 13:24:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:24:52,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:52,138 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,150 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,338 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,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1155405409, now seen corresponding path program 1 times [2025-02-08 13:24:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616521785] [2025-02-08 13:24:52,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:52,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:24:52,510 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,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:52,631 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,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:52,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616521785] [2025-02-08 13:24:52,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616521785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:52,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:52,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870424096] [2025-02-08 13:24:52,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:52,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:52,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:52,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:52,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:52,633 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,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:53,153 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2025-02-08 13:24:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:53,154 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,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:53,154 INFO L225 Difference]: With dead ends: 108 [2025-02-08 13:24:53,154 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 13:24:53,155 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,155 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:53,155 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.5s Time] [2025-02-08 13:24:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 13:24:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-08 13:24:53,164 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,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2025-02-08 13:24:53,165 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 47 [2025-02-08 13:24:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:53,166 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2025-02-08 13:24:53,166 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,167 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2025-02-08 13:24:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:24:53,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:53,169 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,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:24:53,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:53,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1457834480, now seen corresponding path program 1 times [2025-02-08 13:24:53,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:53,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042019835] [2025-02-08 13:24:53,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:53,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:53,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:24:53,326 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,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:53,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:53,397 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,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:53,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042019835] [2025-02-08 13:24:53,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042019835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:53,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:53,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940018601] [2025-02-08 13:24:53,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:53,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:53,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:53,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:53,399 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:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:53,912 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2025-02-08 13:24:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:53,913 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:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:53,914 INFO L225 Difference]: With dead ends: 105 [2025-02-08 13:24:53,914 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 13:24:53,914 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,914 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:53,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:24:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 13:24:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-02-08 13:24:53,919 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:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-02-08 13:24:53,920 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 48 [2025-02-08 13:24:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:53,920 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-02-08 13:24:53,920 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:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-02-08 13:24:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:24:53,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:53,921 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:53,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:24:53,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:53,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1237561128, now seen corresponding path program 1 times [2025-02-08 13:24:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:53,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136993181] [2025-02-08 13:24:53,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:54,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:24:54,041 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,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:54,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:54,167 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,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136993181] [2025-02-08 13:24:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136993181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:24:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300800497] [2025-02-08 13:24:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:54,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:54,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:54,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:54,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:54,168 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,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:54,176 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2025-02-08 13:24:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:54,176 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,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:54,177 INFO L225 Difference]: With dead ends: 111 [2025-02-08 13:24:54,177 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 13:24:54,177 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,177 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,178 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,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 13:24:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 13:24:54,181 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,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-02-08 13:24:54,182 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 54 [2025-02-08 13:24:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:54,182 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-02-08 13:24:54,182 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,182 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-02-08 13:24:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:24:54,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:54,183 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,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:24:54,183 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2085624422, now seen corresponding path program 1 times [2025-02-08 13:24:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002607864] [2025-02-08 13:24:54,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:54,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:24:54,309 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,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:54,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:54,428 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:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002607864] [2025-02-08 13:24:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002607864] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737177126] [2025-02-08 13:24:54,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:54,431 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:54,432 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:54,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:24:54,871 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,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:54,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:54,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:54,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:54,891 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:54,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:24:54,908 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:54,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737177126] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:24:54,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:24:54,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:24:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002948384] [2025-02-08 13:24:54,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:24:54,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:24:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:54,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:24:54,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:54,909 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:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:55,452 INFO L93 Difference]: Finished difference Result 174 states and 200 transitions. [2025-02-08 13:24:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:24:55,454 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:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:55,454 INFO L225 Difference]: With dead ends: 174 [2025-02-08 13:24:55,454 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 13:24:55,454 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:55,455 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:55,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:24:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 13:24:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-08 13:24:55,460 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:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2025-02-08 13:24:55,461 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 54 [2025-02-08 13:24:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:55,461 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2025-02-08 13:24:55,461 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:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2025-02-08 13:24:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 13:24:55,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:55,463 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:55,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:24:55,666 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:55,667 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:55,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1134589092, now seen corresponding path program 1 times [2025-02-08 13:24:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253272158] [2025-02-08 13:24:55,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:55,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:24:55,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:24:55,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:55,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:55,928 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:55,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253272158] [2025-02-08 13:24:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253272158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:55,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:24:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346372019] [2025-02-08 13:24:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:55,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:24:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:55,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:24:55,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:55,929 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:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:55,956 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2025-02-08 13:24:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:24:55,956 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:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:55,957 INFO L225 Difference]: With dead ends: 132 [2025-02-08 13:24:55,957 INFO L226 Difference]: Without dead ends: 128 [2025-02-08 13:24:55,957 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:55,957 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:55,958 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:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-08 13:24:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-02-08 13:24:55,961 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:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2025-02-08 13:24:55,961 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 57 [2025-02-08 13:24:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:55,962 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2025-02-08 13:24:55,962 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:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2025-02-08 13:24:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 13:24:55,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:55,962 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:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:24:55,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:55,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1134559301, now seen corresponding path program 1 times [2025-02-08 13:24:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:55,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318696342] [2025-02-08 13:24:55,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:56,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 13:24:56,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 13:24:56,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:56,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:56,267 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:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318696342] [2025-02-08 13:24:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318696342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:56,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:56,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:24:56,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012110870] [2025-02-08 13:24:56,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:56,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:56,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:56,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:56,268 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:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:56,277 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2025-02-08 13:24:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:56,277 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:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:56,278 INFO L225 Difference]: With dead ends: 128 [2025-02-08 13:24:56,278 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 13:24:56,278 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:56,279 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:56,279 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:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 13:24:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-08 13:24:56,283 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:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-02-08 13:24:56,283 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 57 [2025-02-08 13:24:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:56,283 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-02-08 13:24:56,284 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:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-02-08 13:24:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 13:24:56,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:56,284 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:56,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:24:56,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:56,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:56,285 INFO L85 PathProgramCache]: Analyzing trace with hash 688110328, now seen corresponding path program 1 times [2025-02-08 13:24:56,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:56,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140385995] [2025-02-08 13:24:56,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:56,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 13:24:56,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 13:24:56,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:56,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:56,498 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:56,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140385995] [2025-02-08 13:24:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140385995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:56,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266350120] [2025-02-08 13:24:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:56,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:56,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:56,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:56,499 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:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:56,511 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2025-02-08 13:24:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:56,511 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:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:56,513 INFO L225 Difference]: With dead ends: 128 [2025-02-08 13:24:56,513 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 13:24:56,513 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:56,513 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 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:56,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 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:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 13:24:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-02-08 13:24:56,517 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:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2025-02-08 13:24:56,517 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 58 [2025-02-08 13:24:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:56,518 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2025-02-08 13:24:56,518 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:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2025-02-08 13:24:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:24:56,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:56,518 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:56,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:24:56,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:56,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 976406588, now seen corresponding path program 1 times [2025-02-08 13:24:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:56,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208174240] [2025-02-08 13:24:56,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:56,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 13:24:56,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 13:24:56,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:56,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:56,763 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:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208174240] [2025-02-08 13:24:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208174240] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236811693] [2025-02-08 13:24:56,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:56,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:56,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:56,766 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:56,767 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:57,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 13:24:57,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 13:24:57,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:57,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:57,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:57,256 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:57,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236811693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:24:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720304135] [2025-02-08 13:24:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:24:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:57,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:24:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:57,258 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:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:57,271 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2025-02-08 13:24:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:24:57,271 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:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:57,272 INFO L225 Difference]: With dead ends: 126 [2025-02-08 13:24:57,272 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 13:24:57,272 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:57,274 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 204 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:57,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 204 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:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 13:24:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-02-08 13:24:57,278 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:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2025-02-08 13:24:57,278 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 62 [2025-02-08 13:24:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:57,279 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2025-02-08 13:24:57,279 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:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2025-02-08 13:24:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 13:24:57,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:57,279 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:57,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:24:57,480 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:24:57,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:57,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash 203833133, now seen corresponding path program 1 times [2025-02-08 13:24:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795160645] [2025-02-08 13:24:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:57,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 13:24:57,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 13:24:57,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:57,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:57,703 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:24:57,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:57,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795160645] [2025-02-08 13:24:57,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795160645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:57,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997426636] [2025-02-08 13:24:57,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:57,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:57,706 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:24:57,707 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:24:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 13:24:58,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 13:24:58,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:58,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:58,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:58,188 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:24:58,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:24:58,208 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:24:58,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997426636] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:24:58,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:24:58,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:24:58,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403739243] [2025-02-08 13:24:58,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:24:58,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:24:58,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:58,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:24:58,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:24:58,210 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:24:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:58,231 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2025-02-08 13:24:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:24:58,232 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:24:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:58,232 INFO L225 Difference]: With dead ends: 156 [2025-02-08 13:24:58,232 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 13:24:58,233 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:24:58,233 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:58,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 217 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:24:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 13:24:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2025-02-08 13:24:58,239 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:24:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2025-02-08 13:24:58,240 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 63 [2025-02-08 13:24:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2025-02-08 13:24:58,240 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:24:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2025-02-08 13:24:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 13:24:58,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:58,241 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:24:58,250 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:24:58,441 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:24:58,442 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:24:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1044666538, now seen corresponding path program 2 times [2025-02-08 13:24:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23179690] [2025-02-08 13:24:58,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:24:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:58,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:24:58,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 13:24:58,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:24:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:58,865 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:24:58,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:58,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23179690] [2025-02-08 13:24:58,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23179690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:58,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554698234] [2025-02-08 13:24:58,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:24:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:58,868 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:24:58,869 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:24:59,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:25:01,172 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,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:25:01,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:01,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:25:01,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:01,222 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:01,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:01,276 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:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554698234] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:01,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:01,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-08 13:25:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384860149] [2025-02-08 13:25:01,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:01,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:25:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:01,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:25:01,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:25:01,278 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:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:04,691 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2025-02-08 13:25:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 13:25:04,694 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:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:04,695 INFO L225 Difference]: With dead ends: 246 [2025-02-08 13:25:04,696 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 13:25:04,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 13:25:04,696 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:04,697 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.3s Time] [2025-02-08 13:25:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 13:25:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-08 13:25:04,703 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:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2025-02-08 13:25:04,706 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 72 [2025-02-08 13:25:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:04,706 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2025-02-08 13:25:04,707 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:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2025-02-08 13:25:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 13:25:04,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:04,708 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:04,721 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:04,908 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:04,909 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:25:04,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1252662497, now seen corresponding path program 2 times [2025-02-08 13:25:04,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:04,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670693307] [2025-02-08 13:25:04,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:04,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:05,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-08 13:25:05,074 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:05,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:25:05,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:05,250 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:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:05,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670693307] [2025-02-08 13:25:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670693307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:25:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215156168] [2025-02-08 13:25:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:05,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:25:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:05,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:25:05,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:25:05,251 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:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:06,967 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2025-02-08 13:25:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:06,967 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:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:06,968 INFO L225 Difference]: With dead ends: 226 [2025-02-08 13:25:06,968 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 13:25:06,968 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:06,969 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:06,969 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.7s Time] [2025-02-08 13:25:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 13:25:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-08 13:25:06,973 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:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2025-02-08 13:25:06,974 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 75 [2025-02-08 13:25:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:06,974 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2025-02-08 13:25:06,974 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:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2025-02-08 13:25:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 13:25:06,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:06,975 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:06,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:25:06,975 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:25:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 641484345, now seen corresponding path program 1 times [2025-02-08 13:25:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444678359] [2025-02-08 13:25:06,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:07,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:07,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:07,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:07,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:07,334 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:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444678359] [2025-02-08 13:25:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444678359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54113525] [2025-02-08 13:25:07,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:07,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:07,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:07,336 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:07,338 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:07,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:07,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:07,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:07,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:07,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1886 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:25:07,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:08,017 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:08,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:08,078 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:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54113525] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:08,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-08 13:25:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376433345] [2025-02-08 13:25:08,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:08,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:25:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:08,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:25:08,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:25:08,080 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:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:08,125 INFO L93 Difference]: Finished difference Result 251 states and 296 transitions. [2025-02-08 13:25:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:25:08,125 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:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:08,126 INFO L225 Difference]: With dead ends: 251 [2025-02-08 13:25:08,126 INFO L226 Difference]: Without dead ends: 250 [2025-02-08 13:25:08,126 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:08,127 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 102 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:08,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 325 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-08 13:25:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2025-02-08 13:25:08,133 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:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2025-02-08 13:25:08,134 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 109 [2025-02-08 13:25:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:08,134 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2025-02-08 13:25:08,134 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:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2025-02-08 13:25:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 13:25:08,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:08,135 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:08,145 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:08,340 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:08,340 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:25:08,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1840120927, now seen corresponding path program 1 times [2025-02-08 13:25:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:08,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86331871] [2025-02-08 13:25:08,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:08,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 13:25:08,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 13:25:08,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:08,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:08,670 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:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:08,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86331871] [2025-02-08 13:25:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86331871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:08,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:08,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:25:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593565649] [2025-02-08 13:25:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:08,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:25:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:08,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:25:08,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:08,672 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:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:08,696 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2025-02-08 13:25:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:25:08,696 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:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:08,697 INFO L225 Difference]: With dead ends: 194 [2025-02-08 13:25:08,697 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 13:25:08,697 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:08,698 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:08,698 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:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 13:25:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-02-08 13:25:08,706 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:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2025-02-08 13:25:08,707 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 112 [2025-02-08 13:25:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:08,707 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2025-02-08 13:25:08,707 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:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2025-02-08 13:25:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 13:25:08,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:08,708 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:08,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 13:25:08,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:25:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1840091136, now seen corresponding path program 1 times [2025-02-08 13:25:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069090089] [2025-02-08 13:25:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:08,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 13:25:09,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 13:25:09,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:09,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:10,747 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:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:10,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069090089] [2025-02-08 13:25:10,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069090089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:10,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197498608] [2025-02-08 13:25:10,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:10,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:10,751 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:10,752 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:11,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 13:25:11,350 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,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:11,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:11,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-08 13:25:11,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:11,677 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,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197498608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:11,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 25 [2025-02-08 13:25:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737670187] [2025-02-08 13:25:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:25:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:11,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:25:11,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-02-08 13:25:11,679 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 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:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:15,726 INFO L93 Difference]: Finished difference Result 278 states and 312 transitions. [2025-02-08 13:25:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:25:15,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 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:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:15,728 INFO L225 Difference]: With dead ends: 278 [2025-02-08 13:25:15,728 INFO L226 Difference]: Without dead ends: 206 [2025-02-08 13:25:15,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2025-02-08 13:25:15,730 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:15,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 427 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 13:25:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-08 13:25:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2025-02-08 13:25:15,741 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:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2025-02-08 13:25:15,743 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 112 [2025-02-08 13:25:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:15,743 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2025-02-08 13:25:15,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 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:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2025-02-08 13:25:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 13:25:15,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:15,744 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:15,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:15,944 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:15,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:25:15,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1511273334, now seen corresponding path program 1 times [2025-02-08 13:25:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:15,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039802186] [2025-02-08 13:25:15,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:16,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:16,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:16,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:16,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:16,387 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:16,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039802186] [2025-02-08 13:25:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039802186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534774389] [2025-02-08 13:25:16,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:16,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:16,390 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:16,391 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:16,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 13:25:17,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 13:25:17,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:17,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:17,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:17,137 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:17,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:17,208 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:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534774389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:17,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:17,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:25:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506979217] [2025-02-08 13:25:17,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:17,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:17,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:17,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:17,210 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:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:18,054 INFO L93 Difference]: Finished difference Result 301 states and 330 transitions. [2025-02-08 13:25:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:18,055 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:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:18,056 INFO L225 Difference]: With dead ends: 301 [2025-02-08 13:25:18,056 INFO L226 Difference]: Without dead ends: 300 [2025-02-08 13:25:18,056 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:18,056 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:18,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 13:25:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-08 13:25:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-02-08 13:25:18,065 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:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 327 transitions. [2025-02-08 13:25:18,066 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 327 transitions. Word has length 109 [2025-02-08 13:25:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:18,066 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 327 transitions. [2025-02-08 13:25:18,066 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:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 327 transitions. [2025-02-08 13:25:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 13:25:18,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:18,067 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:18,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 13:25:18,267 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:18,268 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:25:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1488561212, now seen corresponding path program 1 times [2025-02-08 13:25:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:18,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055168925] [2025-02-08 13:25:18,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:18,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:18,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 13:25:18,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 13:25:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:20,418 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:20,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:20,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055168925] [2025-02-08 13:25:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055168925] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:20,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934785776] [2025-02-08 13:25:20,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:20,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:20,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:20,421 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:20,422 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:20,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 13:25:21,155 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,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:21,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:21,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 13:25:21,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:21,222 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:21,223 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:21,408 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:21,409 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:21,431 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:21,431 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:21,451 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:25:21,451 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:21,691 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:21,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:21,814 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:21,851 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:21,872 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:21,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:21,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934785776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:21,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:21,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2025-02-08 13:25:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404697545] [2025-02-08 13:25:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:21,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:25:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:21,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:25:21,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-02-08 13:25:21,874 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:23,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:26,647 INFO L93 Difference]: Finished difference Result 357 states and 394 transitions. [2025-02-08 13:25:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:25:26,650 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:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:26,652 INFO L225 Difference]: With dead ends: 357 [2025-02-08 13:25:26,652 INFO L226 Difference]: Without dead ends: 348 [2025-02-08 13:25:26,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-02-08 13:25:26,653 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:26,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-08 13:25:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-08 13:25:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2025-02-08 13:25:26,679 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:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 329 transitions. [2025-02-08 13:25:26,680 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 329 transitions. Word has length 116 [2025-02-08 13:25:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:26,680 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 329 transitions. [2025-02-08 13:25:26,680 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:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 329 transitions. [2025-02-08 13:25:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-08 13:25:26,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:26,681 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:26,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 13:25:26,881 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:26,882 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-02-08 13:25:26,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1119406950, now seen corresponding path program 1 times [2025-02-08 13:25:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790905973] [2025-02-08 13:25:26,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:27,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 13:25:27,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 13:25:27,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:27,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-08 13:25:31,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:31,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790905973] [2025-02-08 13:25:31,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790905973] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:31,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94826535] [2025-02-08 13:25:31,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:31,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:31,338 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:31,339 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:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 13:25:32,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 13:25:32,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:32,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:32,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-08 13:25:32,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:32,078 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:32,100 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:32,115 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 13:25:32,115 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 17 treesize of output 21 [2025-02-08 13:25:32,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:32,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:32,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:32,176 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 69 treesize of output 62 [2025-02-08 13:25:32,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:32,185 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 41 treesize of output 43 [2025-02-08 13:25:32,214 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:32,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 71 [2025-02-08 13:25:32,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:32,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-02-08 13:25:32,232 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 13:25:32,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-08 13:25:32,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:32,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:25:32,263 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 63 treesize of output 56 [2025-02-08 13:25:32,347 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:32,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:32,366 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:32,367 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 28 treesize of output 23 [2025-02-08 13:25:32,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:32,499 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:32,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:32,516 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:32,516 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 28 treesize of output 23 [2025-02-08 13:25:32,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:32,642 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:32,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:32,660 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:32,661 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 28 treesize of output 23 [2025-02-08 13:25:32,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:32,759 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:32,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:32,771 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:32,771 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 28 treesize of output 23 [2025-02-08 13:25:32,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:32,887 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:32,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:32,904 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:32,904 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 28 treesize of output 23 [2025-02-08 13:25:32,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:33,015 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:33,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:33,031 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:33,032 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 28 treesize of output 23 [2025-02-08 13:25:33,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:33,144 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:33,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:33,158 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:33,158 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 28 treesize of output 23 [2025-02-08 13:25:33,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:33,256 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:33,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:33,271 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:33,272 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 28 treesize of output 23 [2025-02-08 13:25:33,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:33,387 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:33,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:33,408 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:33,409 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 28 treesize of output 23 [2025-02-08 13:25:33,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:33,512 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-02-08 13:25:33,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 13:25:33,525 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 13:25:33,525 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 28 treesize of output 23 [2025-02-08 13:25:33,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-02-08 13:25:33,778 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:33,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:36,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:25:36,355 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 10503 treesize of output 10509 [2025-02-08 13:25:36,462 INFO L349 Elim1Store]: treesize reduction 88, result has 46.7 percent of original size [2025-02-08 13:25:36,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 5626 treesize of output 1399 [2025-02-08 13:25:36,780 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 43083582789 treesize of output 43077291327 [2025-02-08 13:25:39,233 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-02-08 13:25:39,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 206978421918 treesize of output 195092900520