./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/fold-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/fold-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51ce4c2757de3991b684be886f7ff20d2b698c1c8e1eb6aea3e56905f1085bd5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:39:42,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:39:42,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:39:42,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:39:42,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:39:42,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:39:42,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:39:42,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:39:42,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:39:42,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:39:42,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:39:42,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:39:42,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:39:42,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:39:42,930 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:39:42,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:39:42,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:39:42,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:39:42,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:39:42,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:39:42,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:42,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:39:42,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:39:42,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:39:42,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:39:42,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:39:42,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:39:42,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:39:42,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:39:42,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:39:42,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:39:42,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51ce4c2757de3991b684be886f7ff20d2b698c1c8e1eb6aea3e56905f1085bd5 [2025-03-04 14:39:43,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:39:43,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:39:43,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:39:43,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:39:43,155 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:39:43,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/fold-2.i [2025-03-04 14:39:44,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97566682/428eed63b9174a77aa6c787563515944/FLAGdc2cc3434 [2025-03-04 14:39:44,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:39:44,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/fold-2.i [2025-03-04 14:39:44,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97566682/428eed63b9174a77aa6c787563515944/FLAGdc2cc3434 [2025-03-04 14:39:44,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97566682/428eed63b9174a77aa6c787563515944 [2025-03-04 14:39:44,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:39:44,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:39:44,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:44,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:39:44,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:39:44,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76976aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44, skipping insertion in model container [2025-03-04 14:39:44,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:39:45,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:45,683 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:39:45,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:45,919 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:39:45,924 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:39:45,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45 WrapperNode [2025-03-04 14:39:45,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:45,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:45,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:39:45,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:39:45,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:45,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,042 INFO L138 Inliner]: procedures = 581, calls = 798, calls flagged for inlining = 28, calls inlined = 26, statements flattened = 2137 [2025-03-04 14:39:46,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:46,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:39:46,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:39:46,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:39:46,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,173 INFO L175 MemorySlicer]: Split 645 memory accesses to 23 slices as follows [2, 3, 1, 1, 34, 25, 2, 7, 2, 22, 10, 3, 17, 17, 355, 3, 3, 16, 65, 4, 44, 3, 6]. 55 percent of accesses are in the largest equivalence class. The 389 initializations are split as follows [2, 3, 0, 0, 5, 9, 2, 0, 0, 0, 1, 0, 0, 4, 355, 0, 0, 0, 8, 0, 0, 0, 0]. The 116 writes are split as follows [0, 0, 1, 1, 0, 15, 0, 7, 1, 5, 5, 0, 17, 4, 0, 0, 0, 1, 39, 1, 12, 3, 4]. [2025-03-04 14:39:46,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:39:46,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:39:46,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:39:46,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:39:46,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:46,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:46,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:39:46,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:39:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-03-04 14:39:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#22 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#22 [2025-03-04 14:39:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-04 14:39:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-04 14:39:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:39:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure adjust_column [2025-03-04 14:39:46,377 INFO L138 BoogieDeclarations]: Found implementation of procedure adjust_column [2025-03-04 14:39:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 14:39:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 14:39:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 14:39:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 14:39:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 14:39:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 14:39:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 14:39:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 14:39:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 14:39:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 14:39:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 14:39:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 14:39:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 14:39:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 14:39:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 14:39:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 14:39:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 14:39:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 14:39:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 14:39:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-04 14:39:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:39:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 14:39:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:39:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 14:39:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:39:46,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:39:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-03-04 14:39:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#22 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#22 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure write2stdout [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure write2stdout [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:39:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 14:39:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 14:39:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 14:39:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 14:39:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 14:39:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-03-04 14:39:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 14:39:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-03-04 14:39:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:39:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:39:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:39:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 14:39:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#0 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#1 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#2 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#3 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#4 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#5 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#6 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#7 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#8 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#9 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#10 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#11 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#12 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#13 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#14 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#15 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#16 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#17 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#18 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#19 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#20 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#21 [2025-03-04 14:39:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#22 [2025-03-04 14:39:46,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#0 [2025-03-04 14:39:46,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#1 [2025-03-04 14:39:46,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#2 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#3 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#4 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#5 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#6 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#7 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#8 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#9 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#10 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#11 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#12 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#13 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#14 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#15 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#16 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#17 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#18 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#19 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#20 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#21 [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#22 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure xatou_range [2025-03-04 14:39:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure xatou_range [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:39:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:39:46,398 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 14:39:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 14:39:46,982 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:39:46,984 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:39:53,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: havoc _IO_getc_#t~nondet266#1; [2025-03-04 14:39:53,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-04 14:39:53,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: havoc xasprintf_#t~mem240#1.base, xasprintf_#t~mem240#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-03-04 14:39:53,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: call ULTIMATE.dealloc(__main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset);havoc __main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset; [2025-03-04 14:39:53,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: havoc getopt_long_#t~ret295#1; [2025-03-04 14:39:53,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411: havoc fclose_if_not_stdin_#t~bitwise75#1; [2025-03-04 14:39:53,586 INFO L? ?]: Removed 1188 outVars from TransFormulas that were not future-live. [2025-03-04 14:39:53,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:39:53,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:39:53,619 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:39:53,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:53 BoogieIcfgContainer [2025-03-04 14:39:53,619 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:39:53,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:39:53,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:39:53,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:39:53,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:39:44" (1/3) ... [2025-03-04 14:39:53,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6587b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:53, skipping insertion in model container [2025-03-04 14:39:53,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45" (2/3) ... [2025-03-04 14:39:53,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6587b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:53, skipping insertion in model container [2025-03-04 14:39:53,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:53" (3/3) ... [2025-03-04 14:39:53,630 INFO L128 eAbstractionObserver]: Analyzing ICFG fold-2.i [2025-03-04 14:39:53,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:39:53,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fold-2.i that has 102 procedures, 1004 locations, 1 initial locations, 126 loop locations, and 74 error locations. [2025-03-04 14:39:53,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:39:53,696 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;@11094953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:39:53,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-04 14:39:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 646 states, 518 states have (on average 1.638996138996139) internal successors, (849), 598 states have internal predecessors, (849), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 14:39:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:39:53,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:53,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:39:53,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:39:53,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 47498687, now seen corresponding path program 1 times [2025-03-04 14:39:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230331002] [2025-03-04 14:39:53,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:53,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:54,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:39:54,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:39:54,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:54,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:54,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:54,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230331002] [2025-03-04 14:39:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230331002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:54,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415138873] [2025-03-04 14:39:54,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:54,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:54,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:54,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:54,660 INFO L87 Difference]: Start difference. First operand has 646 states, 518 states have (on average 1.638996138996139) internal successors, (849), 598 states have internal predecessors, (849), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:54,881 INFO L93 Difference]: Finished difference Result 1148 states and 1683 transitions. [2025-03-04 14:39:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:39:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:54,897 INFO L225 Difference]: With dead ends: 1148 [2025-03-04 14:39:54,897 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 14:39:54,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:54,906 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 1 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:54,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1348 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 14:39:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-04 14:39:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 426 states have (on average 1.556338028169014) internal successors, (663), 477 states have internal predecessors, (663), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 704 transitions. [2025-03-04 14:39:54,961 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 704 transitions. Word has length 4 [2025-03-04 14:39:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:54,961 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 704 transitions. [2025-03-04 14:39:54,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 704 transitions. [2025-03-04 14:39:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:39:54,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:54,962 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:39:54,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:39:54,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:39:54,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1990610820, now seen corresponding path program 1 times [2025-03-04 14:39:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:54,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153155731] [2025-03-04 14:39:54,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:55,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:55,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:55,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:55,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153155731] [2025-03-04 14:39:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153155731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933204492] [2025-03-04 14:39:55,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:55,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:55,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:55,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:39:56,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:56,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:56,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:56,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:56,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1491 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:56,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:56,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933204492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:39:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841660753] [2025-03-04 14:39:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:56,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:56,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:56,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:56,347 INFO L87 Difference]: Start difference. First operand 506 states and 704 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:56,495 INFO L93 Difference]: Finished difference Result 506 states and 704 transitions. [2025-03-04 14:39:56,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:56,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:39:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:56,497 INFO L225 Difference]: With dead ends: 506 [2025-03-04 14:39:56,497 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 14:39:56,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:56,498 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 1 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:56,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2014 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 14:39:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-04 14:39:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 426 states have (on average 1.5539906103286385) internal successors, (662), 476 states have internal predecessors, (662), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 703 transitions. [2025-03-04 14:39:56,521 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 703 transitions. Word has length 7 [2025-03-04 14:39:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:56,521 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 703 transitions. [2025-03-04 14:39:56,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 703 transitions. [2025-03-04 14:39:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:39:56,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:56,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:39:56,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:39:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:56,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:39:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1579394753, now seen corresponding path program 1 times [2025-03-04 14:39:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:56,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343463691] [2025-03-04 14:39:56,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:56,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:39:57,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:39:57,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:57,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343463691] [2025-03-04 14:39:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343463691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851005364] [2025-03-04 14:39:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:57,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:57,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:57,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:57,141 INFO L87 Difference]: Start difference. First operand 505 states and 703 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:57,263 INFO L93 Difference]: Finished difference Result 505 states and 703 transitions. [2025-03-04 14:39:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-04 14:39:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:57,265 INFO L225 Difference]: With dead ends: 505 [2025-03-04 14:39:57,267 INFO L226 Difference]: Without dead ends: 504 [2025-03-04 14:39:57,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:57,268 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 0 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:57,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1344 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-04 14:39:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2025-03-04 14:39:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 424 states have (on average 1.554245283018868) internal successors, (659), 473 states have internal predecessors, (659), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 700 transitions. [2025-03-04 14:39:57,287 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 700 transitions. Word has length 8 [2025-03-04 14:39:57,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:57,288 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 700 transitions. [2025-03-04 14:39:57,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 700 transitions. [2025-03-04 14:39:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:39:57,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:57,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:57,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:39:57,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:39:57,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash -289050905, now seen corresponding path program 1 times [2025-03-04 14:39:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:57,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766254710] [2025-03-04 14:39:57,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:57,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:57,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:57,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766254710] [2025-03-04 14:39:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766254710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167944729] [2025-03-04 14:39:57,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:57,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:57,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:57,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:39:58,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:58,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:58,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:58,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:39:58,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:58,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:58,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167944729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:58,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:58,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:39:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699551390] [2025-03-04 14:39:58,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:58,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:58,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:58,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:58,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:58,723 INFO L87 Difference]: Start difference. First operand 502 states and 700 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-04 14:39:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:58,827 INFO L93 Difference]: Finished difference Result 502 states and 700 transitions. [2025-03-04 14:39:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:58,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 12 [2025-03-04 14:39:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:58,829 INFO L225 Difference]: With dead ends: 502 [2025-03-04 14:39:58,830 INFO L226 Difference]: Without dead ends: 500 [2025-03-04 14:39:58,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-03-04 14:39:58,830 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 535 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 809 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:58,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 809 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-04 14:39:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-04 14:39:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 424 states have (on average 1.5495283018867925) internal successors, (657), 471 states have internal predecessors, (657), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 698 transitions. [2025-03-04 14:39:58,842 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 698 transitions. Word has length 12 [2025-03-04 14:39:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:58,842 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 698 transitions. [2025-03-04 14:39:58,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-04 14:39:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 698 transitions. [2025-03-04 14:39:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:39:58,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:58,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:58,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 14:39:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 14:39:59,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:39:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -370641992, now seen corresponding path program 1 times [2025-03-04 14:39:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327746150] [2025-03-04 14:39:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:59,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:39:59,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:39:59,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:59,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327746150] [2025-03-04 14:39:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327746150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923614698] [2025-03-04 14:39:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:59,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:59,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:40:00,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:40:00,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:40:00,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:00,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:00,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:00,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:00,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923614698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:00,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:40:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176430716] [2025-03-04 14:40:00,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:00,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:00,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:00,327 INFO L87 Difference]: Start difference. First operand 500 states and 698 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03-04 14:40:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:00,524 INFO L93 Difference]: Finished difference Result 1003 states and 1401 transitions. [2025-03-04 14:40:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 13 [2025-03-04 14:40:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:00,527 INFO L225 Difference]: With dead ends: 1003 [2025-03-04 14:40:00,527 INFO L226 Difference]: Without dead ends: 509 [2025-03-04 14:40:00,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-03-04 14:40:00,528 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 4 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:00,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2009 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-04 14:40:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-04 14:40:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 433 states have (on average 1.53810623556582) internal successors, (666), 480 states have internal predecessors, (666), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 707 transitions. [2025-03-04 14:40:00,545 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 707 transitions. Word has length 13 [2025-03-04 14:40:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 707 transitions. [2025-03-04 14:40:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03-04 14:40:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 707 transitions. [2025-03-04 14:40:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:40:00,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:00,546 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:00,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:40:00,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:00,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:00,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1542468979, now seen corresponding path program 2 times [2025-03-04 14:40:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:00,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554740869] [2025-03-04 14:40:00,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:00,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:40:01,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:40:01,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:40:01,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:01,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554740869] [2025-03-04 14:40:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554740869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271915622] [2025-03-04 14:40:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:01,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:01,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:01,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:01,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:01,323 INFO L87 Difference]: Start difference. First operand 509 states and 707 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-03-04 14:40:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:01,527 INFO L93 Difference]: Finished difference Result 509 states and 707 transitions. [2025-03-04 14:40:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-03-04 14:40:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:01,530 INFO L225 Difference]: With dead ends: 509 [2025-03-04 14:40:01,530 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 14:40:01,530 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-03-04 14:40:01,531 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 534 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:01,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2124 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 14:40:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-04 14:40:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 433 states have (on average 1.533487297921478) internal successors, (664), 478 states have internal predecessors, (664), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 705 transitions. [2025-03-04 14:40:01,552 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 705 transitions. Word has length 22 [2025-03-04 14:40:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:01,552 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 705 transitions. [2025-03-04 14:40:01,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-03-04 14:40:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 705 transitions. [2025-03-04 14:40:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:40:01,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:01,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:40:01,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:01,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash 582233031, now seen corresponding path program 1 times [2025-03-04 14:40:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372707641] [2025-03-04 14:40:01,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:01,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:40:01,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:40:01,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:01,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:02,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:02,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372707641] [2025-03-04 14:40:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372707641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:02,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:02,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078691668] [2025-03-04 14:40:02,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:02,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:02,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:02,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:02,002 INFO L87 Difference]: Start difference. First operand 507 states and 705 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-03-04 14:40:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:02,132 INFO L93 Difference]: Finished difference Result 997 states and 1394 transitions. [2025-03-04 14:40:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 27 [2025-03-04 14:40:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:02,134 INFO L225 Difference]: With dead ends: 997 [2025-03-04 14:40:02,134 INFO L226 Difference]: Without dead ends: 510 [2025-03-04 14:40:02,135 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-03-04 14:40:02,135 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 2 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:02,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1333 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-04 14:40:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-04 14:40:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 436 states have (on average 1.5298165137614679) internal successors, (667), 481 states have internal predecessors, (667), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 708 transitions. [2025-03-04 14:40:02,150 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 708 transitions. Word has length 27 [2025-03-04 14:40:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:02,150 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 708 transitions. [2025-03-04 14:40:02,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-03-04 14:40:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 708 transitions. [2025-03-04 14:40:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:02,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:02,151 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:40:02,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:02,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2062464724, now seen corresponding path program 1 times [2025-03-04 14:40:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:02,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042935366] [2025-03-04 14:40:02,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:02,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:02,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:02,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:40:02,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:02,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042935366] [2025-03-04 14:40:02,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042935366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:02,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:02,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167334621] [2025-03-04 14:40:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:02,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:02,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:02,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:02,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:02,557 INFO L87 Difference]: Start difference. First operand 510 states and 708 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-03-04 14:40:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:02,662 INFO L93 Difference]: Finished difference Result 523 states and 723 transitions. [2025-03-04 14:40:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:02,663 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 30 [2025-03-04 14:40:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:02,665 INFO L225 Difference]: With dead ends: 523 [2025-03-04 14:40:02,665 INFO L226 Difference]: Without dead ends: 521 [2025-03-04 14:40:02,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:02,665 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 3 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:02,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1330 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-04 14:40:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2025-03-04 14:40:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 445 states have (on average 1.5280898876404494) internal successors, (680), 490 states have internal predecessors, (680), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 721 transitions. [2025-03-04 14:40:02,676 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 721 transitions. Word has length 30 [2025-03-04 14:40:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:02,676 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 721 transitions. [2025-03-04 14:40:02,676 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-03-04 14:40:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 721 transitions. [2025-03-04 14:40:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:02,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:02,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:02,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:40:02,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:02,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2062464564, now seen corresponding path program 1 times [2025-03-04 14:40:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085362147] [2025-03-04 14:40:02,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:02,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:02,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:02,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085362147] [2025-03-04 14:40:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085362147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789219628] [2025-03-04 14:40:03,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:03,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:03,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:03,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:03,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:40:03,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:04,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:04,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:04,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:04,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:40:04,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:40:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789219628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:04,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:40:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398080141] [2025-03-04 14:40:04,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:04,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:40:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:04,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:40:04,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:04,281 INFO L87 Difference]: Start difference. First operand 519 states and 721 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-03-04 14:40:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:04,566 INFO L93 Difference]: Finished difference Result 1040 states and 1450 transitions. [2025-03-04 14:40:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:40:04,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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 30 [2025-03-04 14:40:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:04,569 INFO L225 Difference]: With dead ends: 1040 [2025-03-04 14:40:04,569 INFO L226 Difference]: Without dead ends: 536 [2025-03-04 14:40:04,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:04,570 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 5 mSDsluCounter, 3305 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3968 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:04,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3968 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-04 14:40:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-04 14:40:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 463 states have (on average 1.5032397408207343) internal successors, (696), 507 states have internal predecessors, (696), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 737 transitions. [2025-03-04 14:40:04,582 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 737 transitions. Word has length 30 [2025-03-04 14:40:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:04,582 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 737 transitions. [2025-03-04 14:40:04,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-03-04 14:40:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 737 transitions. [2025-03-04 14:40:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:40:04,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:04,583 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] [2025-03-04 14:40:04,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:04,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:04,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1801379785, now seen corresponding path program 1 times [2025-03-04 14:40:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861713002] [2025-03-04 14:40:04,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:05,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:40:05,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:40:05,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:05,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:40:05,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861713002] [2025-03-04 14:40:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861713002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:05,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:05,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005695297] [2025-03-04 14:40:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:05,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:05,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:05,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:05,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:05,238 INFO L87 Difference]: Start difference. First operand 536 states and 737 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-03-04 14:40:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:05,374 INFO L93 Difference]: Finished difference Result 536 states and 737 transitions. [2025-03-04 14:40:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-03-04 14:40:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:05,378 INFO L225 Difference]: With dead ends: 536 [2025-03-04 14:40:05,378 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 14:40:05,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:05,379 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 0 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:05,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1331 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 14:40:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2025-03-04 14:40:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 459 states have (on average 1.5032679738562091) internal successors, (690), 502 states have internal predecessors, (690), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 731 transitions. [2025-03-04 14:40:05,398 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 731 transitions. Word has length 49 [2025-03-04 14:40:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:05,398 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 731 transitions. [2025-03-04 14:40:05,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-03-04 14:40:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 731 transitions. [2025-03-04 14:40:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:40:05,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:05,401 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] [2025-03-04 14:40:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:40:05,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:05,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash -103172106, now seen corresponding path program 1 times [2025-03-04 14:40:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498233267] [2025-03-04 14:40:05,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:05,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:40:05,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:40:05,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:05,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:05,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498233267] [2025-03-04 14:40:05,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498233267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:05,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:05,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757239850] [2025-03-04 14:40:05,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:05,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:05,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:05,843 INFO L87 Difference]: Start difference. First operand 531 states and 731 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-03-04 14:40:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:05,923 INFO L93 Difference]: Finished difference Result 545 states and 749 transitions. [2025-03-04 14:40:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2025-03-04 14:40:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:05,926 INFO L225 Difference]: With dead ends: 545 [2025-03-04 14:40:05,926 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 14:40:05,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:05,926 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 11 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:05,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1327 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 14:40:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542. [2025-03-04 14:40:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 470 states have (on average 1.5) internal successors, (705), 513 states have internal predecessors, (705), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 746 transitions. [2025-03-04 14:40:05,937 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 746 transitions. Word has length 50 [2025-03-04 14:40:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:05,937 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 746 transitions. [2025-03-04 14:40:05,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-03-04 14:40:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 746 transitions. [2025-03-04 14:40:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 14:40:05,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:05,940 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-03-04 14:40:05,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:40:05,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash -237530618, now seen corresponding path program 1 times [2025-03-04 14:40:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927046761] [2025-03-04 14:40:05,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:06,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:40:06,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:40:06,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:06,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927046761] [2025-03-04 14:40:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927046761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:06,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:06,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004417847] [2025-03-04 14:40:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:06,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:06,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:06,366 INFO L87 Difference]: Start difference. First operand 542 states and 746 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-03-04 14:40:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:06,547 INFO L93 Difference]: Finished difference Result 813 states and 1145 transitions. [2025-03-04 14:40:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-03-04 14:40:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:06,550 INFO L225 Difference]: With dead ends: 813 [2025-03-04 14:40:06,550 INFO L226 Difference]: Without dead ends: 811 [2025-03-04 14:40:06,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:06,552 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 373 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:06,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1316 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-04 14:40:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 546. [2025-03-04 14:40:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 474 states have (on average 1.4978902953586497) internal successors, (710), 517 states have internal predecessors, (710), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 751 transitions. [2025-03-04 14:40:06,570 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 751 transitions. Word has length 54 [2025-03-04 14:40:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 751 transitions. [2025-03-04 14:40:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-03-04 14:40:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 751 transitions. [2025-03-04 14:40:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:06,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:06,572 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, 1] [2025-03-04 14:40:06,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:40:06,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 653860607, now seen corresponding path program 1 times [2025-03-04 14:40:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18035188] [2025-03-04 14:40:06,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:06,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:06,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:06,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:06,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:07,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:07,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18035188] [2025-03-04 14:40:07,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18035188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:07,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673657742] [2025-03-04 14:40:07,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:07,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:07,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:07,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:07,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:40:07,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:07,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:07,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:07,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:07,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:07,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:08,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:08,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673657742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:08,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:08,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:40:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870826028] [2025-03-04 14:40:08,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:08,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:08,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:08,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:08,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:08,043 INFO L87 Difference]: Start difference. First operand 546 states and 751 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-03-04 14:40:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:08,163 INFO L93 Difference]: Finished difference Result 1067 states and 1479 transitions. [2025-03-04 14:40:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:08,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 55 [2025-03-04 14:40:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:08,169 INFO L225 Difference]: With dead ends: 1067 [2025-03-04 14:40:08,169 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 14:40:08,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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-03-04 14:40:08,171 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 4 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:08,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1331 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 14:40:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-04 14:40:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 492 states have (on average 1.4796747967479675) internal successors, (728), 535 states have internal predecessors, (728), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 769 transitions. [2025-03-04 14:40:08,188 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 769 transitions. Word has length 55 [2025-03-04 14:40:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:08,188 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 769 transitions. [2025-03-04 14:40:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-03-04 14:40:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 769 transitions. [2025-03-04 14:40:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:08,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:08,189 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] [2025-03-04 14:40:08,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:40:08,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 14:40:08,393 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:08,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2136719229, now seen corresponding path program 1 times [2025-03-04 14:40:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300603049] [2025-03-04 14:40:08,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:08,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:08,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:08,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:08,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:08,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300603049] [2025-03-04 14:40:08,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300603049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10094170] [2025-03-04 14:40:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:08,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:08,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:40:09,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:09,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:09,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:09,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:09,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:09,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:09,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:09,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10094170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:09,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:40:09,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:40:09,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538961440] [2025-03-04 14:40:09,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:09,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:09,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:09,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:09,739 INFO L87 Difference]: Start difference. First operand 564 states and 769 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-03-04 14:40:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:09,873 INFO L93 Difference]: Finished difference Result 565 states and 770 transitions. [2025-03-04 14:40:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:09,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 55 [2025-03-04 14:40:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:09,877 INFO L225 Difference]: With dead ends: 565 [2025-03-04 14:40:09,877 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 14:40:09,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:09,879 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 21 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:09,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1337 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 14:40:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 563. [2025-03-04 14:40:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 492 states have (on average 1.4776422764227641) internal successors, (727), 534 states have internal predecessors, (727), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 768 transitions. [2025-03-04 14:40:09,901 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 768 transitions. Word has length 55 [2025-03-04 14:40:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:09,901 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 768 transitions. [2025-03-04 14:40:09,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-03-04 14:40:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 768 transitions. [2025-03-04 14:40:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 14:40:09,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:09,902 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 14:40:09,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:40:10,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:10,103 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:10,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1813788046, now seen corresponding path program 1 times [2025-03-04 14:40:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:10,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866206629] [2025-03-04 14:40:10,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:10,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:40:10,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:40:10,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:10,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:10,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:10,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866206629] [2025-03-04 14:40:10,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866206629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:10,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826351762] [2025-03-04 14:40:10,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:10,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:10,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:10,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:40:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:40:11,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:40:11,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:11,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:11,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:11,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:11,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826351762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:11,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:40:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400029416] [2025-03-04 14:40:11,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:11,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:11,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:11,670 INFO L87 Difference]: Start difference. First operand 563 states and 768 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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-03-04 14:40:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:11,799 INFO L93 Difference]: Finished difference Result 601 states and 820 transitions. [2025-03-04 14:40:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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 56 [2025-03-04 14:40:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:11,802 INFO L225 Difference]: With dead ends: 601 [2025-03-04 14:40:11,802 INFO L226 Difference]: Without dead ends: 600 [2025-03-04 14:40:11,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 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-03-04 14:40:11,802 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 50 mSDsluCounter, 2005 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:11,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 2670 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-04 14:40:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 596. [2025-03-04 14:40:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 525 states have (on average 1.4704761904761905) internal successors, (772), 567 states have internal predecessors, (772), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 813 transitions. [2025-03-04 14:40:11,817 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 813 transitions. Word has length 56 [2025-03-04 14:40:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:11,817 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 813 transitions. [2025-03-04 14:40:11,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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-03-04 14:40:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 813 transitions. [2025-03-04 14:40:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 14:40:11,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:11,817 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] [2025-03-04 14:40:11,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:12,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:12,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash 983111114, now seen corresponding path program 1 times [2025-03-04 14:40:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793614260] [2025-03-04 14:40:12,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:12,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:40:12,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:40:12,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:12,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793614260] [2025-03-04 14:40:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793614260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78853453] [2025-03-04 14:40:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:12,415 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:12,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:40:13,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:40:13,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:40:13,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:13,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:13,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:13,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:13,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78853453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:40:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:40:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934947930] [2025-03-04 14:40:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:13,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:13,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:13,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:13,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:13,394 INFO L87 Difference]: Start difference. First operand 596 states and 813 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-03-04 14:40:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:13,581 INFO L93 Difference]: Finished difference Result 865 states and 1210 transitions. [2025-03-04 14:40:13,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:13,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 58 [2025-03-04 14:40:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:13,584 INFO L225 Difference]: With dead ends: 865 [2025-03-04 14:40:13,584 INFO L226 Difference]: Without dead ends: 864 [2025-03-04 14:40:13,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:13,585 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 745 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:13,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1686 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-04 14:40:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 595. [2025-03-04 14:40:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 525 states have (on average 1.4685714285714286) internal successors, (771), 566 states have internal predecessors, (771), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 812 transitions. [2025-03-04 14:40:13,599 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 812 transitions. Word has length 58 [2025-03-04 14:40:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 812 transitions. [2025-03-04 14:40:13,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-03-04 14:40:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 812 transitions. [2025-03-04 14:40:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:40:13,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:13,600 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] [2025-03-04 14:40:13,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:13,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 14:40:13,801 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:13,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash 411674837, now seen corresponding path program 1 times [2025-03-04 14:40:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079184166] [2025-03-04 14:40:13,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:14,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:40:14,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:40:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:14,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:14,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079184166] [2025-03-04 14:40:14,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079184166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:14,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323270222] [2025-03-04 14:40:14,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:14,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:14,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:14,187 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:14,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:40:15,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:40:15,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:40:15,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:15,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:15,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1855 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:15,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:15,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323270222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:15,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:40:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949688140] [2025-03-04 14:40:15,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:15,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:15,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:15,276 INFO L87 Difference]: Start difference. First operand 595 states and 812 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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-03-04 14:40:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:15,712 INFO L93 Difference]: Finished difference Result 1668 states and 2398 transitions. [2025-03-04 14:40:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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 59 [2025-03-04 14:40:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:15,718 INFO L225 Difference]: With dead ends: 1668 [2025-03-04 14:40:15,718 INFO L226 Difference]: Without dead ends: 1667 [2025-03-04 14:40:15,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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-03-04 14:40:15,719 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 1488 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 4387 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:15,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 4387 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:40:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-04 14:40:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 607. [2025-03-04 14:40:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 537 states have (on average 1.4636871508379887) internal successors, (786), 578 states have internal predecessors, (786), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 827 transitions. [2025-03-04 14:40:15,743 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 827 transitions. Word has length 59 [2025-03-04 14:40:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:15,743 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 827 transitions. [2025-03-04 14:40:15,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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-03-04 14:40:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 827 transitions. [2025-03-04 14:40:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 14:40:15,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:15,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:15,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:15,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 14:40:15,945 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:15,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1461582641, now seen corresponding path program 1 times [2025-03-04 14:40:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:15,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107433756] [2025-03-04 14:40:15,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:16,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 14:40:16,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 14:40:16,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:16,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:16,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107433756] [2025-03-04 14:40:16,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107433756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:16,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436761009] [2025-03-04 14:40:16,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:16,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:16,350 INFO L87 Difference]: Start difference. First operand 607 states and 827 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:16,510 INFO L93 Difference]: Finished difference Result 1125 states and 1565 transitions. [2025-03-04 14:40:16,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:16,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2025-03-04 14:40:16,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:16,513 INFO L225 Difference]: With dead ends: 1125 [2025-03-04 14:40:16,513 INFO L226 Difference]: Without dead ends: 702 [2025-03-04 14:40:16,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-03-04 14:40:16,514 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 119 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:16,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1254 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-04 14:40:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 649. [2025-03-04 14:40:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 578 states have (on average 1.4567474048442905) internal successors, (842), 619 states have internal predecessors, (842), 27 states have call successors, (27), 14 states have call predecessors, (27), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:40:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 885 transitions. [2025-03-04 14:40:16,528 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 885 transitions. Word has length 68 [2025-03-04 14:40:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 885 transitions. [2025-03-04 14:40:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 885 transitions. [2025-03-04 14:40:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 14:40:16,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:16,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:16,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:40:16,531 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:16,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 126655439, now seen corresponding path program 1 times [2025-03-04 14:40:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078205051] [2025-03-04 14:40:16,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:16,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 14:40:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 14:40:16,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:16,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:17,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078205051] [2025-03-04 14:40:17,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078205051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:17,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:17,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:17,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049005027] [2025-03-04 14:40:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:17,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:17,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:17,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:17,078 INFO L87 Difference]: Start difference. First operand 649 states and 885 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:17,173 INFO L93 Difference]: Finished difference Result 651 states and 885 transitions. [2025-03-04 14:40:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2025-03-04 14:40:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:17,176 INFO L225 Difference]: With dead ends: 651 [2025-03-04 14:40:17,176 INFO L226 Difference]: Without dead ends: 649 [2025-03-04 14:40:17,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:17,177 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 1 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:17,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1327 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-04 14:40:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-03-04 14:40:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 578 states have (on average 1.453287197231834) internal successors, (840), 619 states have internal predecessors, (840), 27 states have call successors, (27), 14 states have call predecessors, (27), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:40:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 883 transitions. [2025-03-04 14:40:17,192 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 883 transitions. Word has length 70 [2025-03-04 14:40:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:17,218 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 883 transitions. [2025-03-04 14:40:17,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 883 transitions. [2025-03-04 14:40:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 14:40:17,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:17,219 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] [2025-03-04 14:40:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 14:40:17,219 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:17,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1139928311, now seen corresponding path program 2 times [2025-03-04 14:40:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:17,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162677166] [2025-03-04 14:40:17,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:17,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-04 14:40:17,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 71 statements. [2025-03-04 14:40:17,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:40:17,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-04 14:40:17,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:17,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162677166] [2025-03-04 14:40:17,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162677166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:17,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548352443] [2025-03-04 14:40:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:17,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:17,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:17,691 INFO L87 Difference]: Start difference. First operand 649 states and 883 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03-04 14:40:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:17,797 INFO L93 Difference]: Finished difference Result 1211 states and 1661 transitions. [2025-03-04 14:40:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:17,797 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), 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 71 [2025-03-04 14:40:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:17,799 INFO L225 Difference]: With dead ends: 1211 [2025-03-04 14:40:17,799 INFO L226 Difference]: Without dead ends: 653 [2025-03-04 14:40:17,800 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-03-04 14:40:17,802 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 27 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:17,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1293 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-04 14:40:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-04 14:40:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 581 states have (on average 1.4492254733218588) internal successors, (842), 622 states have internal predecessors, (842), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:40:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 885 transitions. [2025-03-04 14:40:17,820 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 885 transitions. Word has length 71 [2025-03-04 14:40:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:17,820 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 885 transitions. [2025-03-04 14:40:17,820 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), 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-03-04 14:40:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 885 transitions. [2025-03-04 14:40:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:40:17,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:17,821 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, 1] [2025-03-04 14:40:17,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:40:17,821 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2025-03-04 14:40:17,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:17,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1599268817, now seen corresponding path program 2 times [2025-03-04 14:40:17,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:17,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832297265] [2025-03-04 14:40:17,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:18,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:40:18,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:40:18,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:40:18,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 14:40:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832297265] [2025-03-04 14:40:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832297265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952593157] [2025-03-04 14:40:18,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:18,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:18,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:40:19,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.