./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:14:46,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:14:46,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:14:46,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:14:46,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:14:46,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:14:46,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:14:46,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:14:46,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:14:46,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:14:46,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:14:46,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:14:46,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:14:46,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:14:46,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:14:46,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:14:46,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:14:46,190 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2025-03-17 19:14:46,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:14:46,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:14:46,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:14:46,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:14:46,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:14:46,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2025-03-17 19:14:47,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedf9900b/499b0a4df804414ca2c38cf881dbbb52/FLAGdb9a2a76c [2025-03-17 19:14:47,833 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:14:47,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2025-03-17 19:14:47,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedf9900b/499b0a4df804414ca2c38cf881dbbb52/FLAGdb9a2a76c [2025-03-17 19:14:48,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedf9900b/499b0a4df804414ca2c38cf881dbbb52 [2025-03-17 19:14:48,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:14:48,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:14:48,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:14:48,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:14:48,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:14:48,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495cfb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48, skipping insertion in model container [2025-03-17 19:14:48,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:14:48,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:14:48,645 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:14:48,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:14:48,753 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:14:48,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48 WrapperNode [2025-03-17 19:14:48,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:14:48,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:14:48,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:14:48,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:14:48,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,825 INFO L138 Inliner]: procedures = 282, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1442 [2025-03-17 19:14:48,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:14:48,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:14:48,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:14:48,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:14:48,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,907 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 34, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 4, 49]. [2025-03-17 19:14:48,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:14:48,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:14:48,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:14:48,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:14:48,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (1/1) ... [2025-03-17 19:14:48,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:14:48,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:48,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:14:49,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 19:14:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-17 19:14:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 19:14:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 19:14:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-17 19:14:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-17 19:14:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 19:14:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:14:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:14:49,198 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:14:49,199 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:14:49,256 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-17 19:14:50,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-17 19:14:50,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-17 19:14:50,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 19:14:50,351 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-17 19:14:50,351 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:14:50,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:14:50,415 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 19:14:50,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:50 BoogieIcfgContainer [2025-03-17 19:14:50,416 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:14:50,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:14:50,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:14:50,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:14:50,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:14:48" (1/3) ... [2025-03-17 19:14:50,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b00447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:50, skipping insertion in model container [2025-03-17 19:14:50,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:48" (2/3) ... [2025-03-17 19:14:50,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b00447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:50, skipping insertion in model container [2025-03-17 19:14:50,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:50" (3/3) ... [2025-03-17 19:14:50,424 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-1.i [2025-03-17 19:14:50,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:14:50,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test6-1.i that has 6 procedures, 454 locations, 1 initial locations, 34 loop locations, and 14 error locations. [2025-03-17 19:14:50,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:14:50,490 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;@4c714586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:14:50,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 19:14:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 454 states, 417 states have (on average 1.6067146282973621) internal successors, (670), 434 states have internal predecessors, (670), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 19:14:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:14:50,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:50,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:50,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:50,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 514595481, now seen corresponding path program 1 times [2025-03-17 19:14:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469958273] [2025-03-17 19:14:50,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:50,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:14:50,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:14:50,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:50,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469958273] [2025-03-17 19:14:50,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469958273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:50,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:14:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860366114] [2025-03-17 19:14:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:50,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 19:14:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:50,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:14:50,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:14:50,660 INFO L87 Difference]: Start difference. First operand has 454 states, 417 states have (on average 1.6067146282973621) internal successors, (670), 434 states have internal predecessors, (670), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-17 19:14:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:50,766 INFO L93 Difference]: Finished difference Result 902 states and 1416 transitions. [2025-03-17 19:14:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:14:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-17 19:14:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:50,778 INFO L225 Difference]: With dead ends: 902 [2025-03-17 19:14:50,778 INFO L226 Difference]: Without dead ends: 435 [2025-03-17 19:14:50,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:14:50,785 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:50,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-17 19:14:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-03-17 19:14:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 407 states have (on average 1.457002457002457) internal successors, (593), 421 states have internal predecessors, (593), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 19:14:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 613 transitions. [2025-03-17 19:14:50,827 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 613 transitions. Word has length 7 [2025-03-17 19:14:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:50,827 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 613 transitions. [2025-03-17 19:14:50,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-17 19:14:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 613 transitions. [2025-03-17 19:14:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:14:50,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:50,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:14:50,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:50,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash 514596442, now seen corresponding path program 1 times [2025-03-17 19:14:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:50,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887778255] [2025-03-17 19:14:50,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:50,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:14:50,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:14:50,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:50,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:14:50,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662574782] [2025-03-17 19:14:50,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:50,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:50,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:50,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:50,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:14:50,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:14:51,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:14:51,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:51,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:51,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:14:51,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:51,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:14:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:51,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:14:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887778255] [2025-03-17 19:14:51,085 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:14:51,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662574782] [2025-03-17 19:14:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662574782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:14:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521598395] [2025-03-17 19:14:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:51,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:51,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:51,089 INFO L87 Difference]: Start difference. First operand 435 states and 613 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:51,339 INFO L93 Difference]: Finished difference Result 838 states and 1195 transitions. [2025-03-17 19:14:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:51,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 19:14:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:51,346 INFO L225 Difference]: With dead ends: 838 [2025-03-17 19:14:51,346 INFO L226 Difference]: Without dead ends: 836 [2025-03-17 19:14:51,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:51,349 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 556 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:51,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1706 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:14:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-17 19:14:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 442. [2025-03-17 19:14:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 414 states have (on average 1.4516908212560387) internal successors, (601), 428 states have internal predecessors, (601), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 19:14:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 621 transitions. [2025-03-17 19:14:51,381 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 621 transitions. Word has length 7 [2025-03-17 19:14:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:51,381 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 621 transitions. [2025-03-17 19:14:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 621 transitions. [2025-03-17 19:14:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 19:14:51,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:51,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:51,392 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-17 19:14:51,584 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-17 19:14:51,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:51,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1360794116, now seen corresponding path program 1 times [2025-03-17 19:14:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137578310] [2025-03-17 19:14:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:14:51,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:14:51,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:51,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:51,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:51,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137578310] [2025-03-17 19:14:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137578310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:51,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:51,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:14:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280963574] [2025-03-17 19:14:51,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:51,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:14:51,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:51,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:14:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:51,924 INFO L87 Difference]: Start difference. First operand 442 states and 621 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:52,056 INFO L93 Difference]: Finished difference Result 834 states and 1167 transitions. [2025-03-17 19:14:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:14:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-17 19:14:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:52,059 INFO L225 Difference]: With dead ends: 834 [2025-03-17 19:14:52,059 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 19:14:52,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:52,060 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 18 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:52,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1418 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 19:14:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-17 19:14:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 372 states have (on average 1.4086021505376345) internal successors, (524), 386 states have internal predecessors, (524), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 19:14:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 544 transitions. [2025-03-17 19:14:52,071 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 544 transitions. Word has length 61 [2025-03-17 19:14:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:52,071 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 544 transitions. [2025-03-17 19:14:52,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 544 transitions. [2025-03-17 19:14:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 19:14:52,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:52,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:52,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:14:52,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:52,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 619202934, now seen corresponding path program 1 times [2025-03-17 19:14:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749979197] [2025-03-17 19:14:52,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:52,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:14:52,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:14:52,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:52,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749979197] [2025-03-17 19:14:52,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749979197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:52,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:52,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:14:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119772517] [2025-03-17 19:14:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:52,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:52,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:52,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:52,330 INFO L87 Difference]: Start difference. First operand 400 states and 544 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:52,478 INFO L93 Difference]: Finished difference Result 723 states and 993 transitions. [2025-03-17 19:14:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:52,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-17 19:14:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:52,483 INFO L225 Difference]: With dead ends: 723 [2025-03-17 19:14:52,483 INFO L226 Difference]: Without dead ends: 719 [2025-03-17 19:14:52,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:52,485 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 377 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:52,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1470 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-17 19:14:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 711. [2025-03-17 19:14:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 680 states have (on average 1.4161764705882354) internal successors, (963), 695 states have internal predecessors, (963), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:14:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 989 transitions. [2025-03-17 19:14:52,507 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 989 transitions. Word has length 61 [2025-03-17 19:14:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:52,508 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 989 transitions. [2025-03-17 19:14:52,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2025-03-17 19:14:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 19:14:52,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:52,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:52,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:14:52,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:52,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2054098532, now seen corresponding path program 1 times [2025-03-17 19:14:52,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:52,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836969581] [2025-03-17 19:14:52,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:52,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:52,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 19:14:52,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 19:14:52,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:52,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836969581] [2025-03-17 19:14:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836969581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:14:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24449320] [2025-03-17 19:14:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:52,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:52,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:52,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:52,729 INFO L87 Difference]: Start difference. First operand 711 states and 989 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:52,904 INFO L93 Difference]: Finished difference Result 1667 states and 2362 transitions. [2025-03-17 19:14:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:52,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-17 19:14:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:52,910 INFO L225 Difference]: With dead ends: 1667 [2025-03-17 19:14:52,910 INFO L226 Difference]: Without dead ends: 1273 [2025-03-17 19:14:52,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:52,913 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 475 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:52,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1440 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-03-17 19:14:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 711. [2025-03-17 19:14:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 680 states have (on average 1.4147058823529413) internal successors, (962), 695 states have internal predecessors, (962), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:14:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 988 transitions. [2025-03-17 19:14:52,937 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 988 transitions. Word has length 67 [2025-03-17 19:14:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:52,937 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 988 transitions. [2025-03-17 19:14:52,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 988 transitions. [2025-03-17 19:14:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 19:14:52,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:52,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:52,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:14:52,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:52,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1434511366, now seen corresponding path program 1 times [2025-03-17 19:14:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837238406] [2025-03-17 19:14:52,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:52,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 19:14:52,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 19:14:52,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:52,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:53,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:53,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837238406] [2025-03-17 19:14:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837238406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:53,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:14:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272504171] [2025-03-17 19:14:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:53,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:14:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:53,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:14:53,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:53,099 INFO L87 Difference]: Start difference. First operand 711 states and 988 transitions. Second operand has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 19:14:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:53,184 INFO L93 Difference]: Finished difference Result 938 states and 1299 transitions. [2025-03-17 19:14:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:53,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2025-03-17 19:14:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:53,188 INFO L225 Difference]: With dead ends: 938 [2025-03-17 19:14:53,189 INFO L226 Difference]: Without dead ends: 936 [2025-03-17 19:14:53,189 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-17 19:14:53,189 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 403 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:53,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 987 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-17 19:14:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 926. [2025-03-17 19:14:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 887 states have (on average 1.4216459977452085) internal successors, (1261), 903 states have internal predecessors, (1261), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 19:14:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1297 transitions. [2025-03-17 19:14:53,212 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1297 transitions. Word has length 71 [2025-03-17 19:14:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:53,213 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1297 transitions. [2025-03-17 19:14:53,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 19:14:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1297 transitions. [2025-03-17 19:14:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:14:53,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:53,214 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:53,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:14:53,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:53,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash -87399084, now seen corresponding path program 1 times [2025-03-17 19:14:53,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:53,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897846603] [2025-03-17 19:14:53,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:53,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:53,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:14:53,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:14:53,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:53,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:53,490 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-17 19:14:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897846603] [2025-03-17 19:14:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897846603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934808759] [2025-03-17 19:14:53,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:53,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:53,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:53,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:14:53,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:14:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:14:53,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:53,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:53,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:14:53,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:53,731 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-17 19:14:53,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:14:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934808759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:14:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-17 19:14:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466380476] [2025-03-17 19:14:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:14:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:53,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:14:53,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:14:53,734 INFO L87 Difference]: Start difference. First operand 926 states and 1297 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 19:14:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:53,867 INFO L93 Difference]: Finished difference Result 1247 states and 1744 transitions. [2025-03-17 19:14:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:14:53,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2025-03-17 19:14:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:53,873 INFO L225 Difference]: With dead ends: 1247 [2025-03-17 19:14:53,873 INFO L226 Difference]: Without dead ends: 1246 [2025-03-17 19:14:53,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:14:53,874 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 496 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:53,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1395 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-17 19:14:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1045. [2025-03-17 19:14:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1004 states have (on average 1.4143426294820718) internal successors, (1420), 1021 states have internal predecessors, (1420), 20 states have call successors, (20), 10 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 19:14:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1460 transitions. [2025-03-17 19:14:53,903 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1460 transitions. Word has length 79 [2025-03-17 19:14:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1460 transitions. [2025-03-17 19:14:53,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 19:14:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1460 transitions. [2025-03-17 19:14:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 19:14:53,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:53,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:53,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:14:54,104 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,SelfDestructingSolverStorable6 [2025-03-17 19:14:54,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1585595670, now seen corresponding path program 1 times [2025-03-17 19:14:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175733139] [2025-03-17 19:14:54,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:54,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:14:54,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:14:54,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:54,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:54,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175733139] [2025-03-17 19:14:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175733139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:54,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127266353] [2025-03-17 19:14:54,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:54,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:54,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:54,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:54,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:14:54,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:14:54,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:14:54,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:54,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:54,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:14:54,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:54,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:14:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:54,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127266353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:14:54,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:14:54,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-03-17 19:14:54,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556984726] [2025-03-17 19:14:54,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:14:54,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 19:14:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:54,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:14:54,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:14:54,838 INFO L87 Difference]: Start difference. First operand 1045 states and 1460 transitions. Second operand has 18 states, 17 states have (on average 12.588235294117647) internal successors, (214), 15 states have internal predecessors, (214), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 19:14:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:55,925 INFO L93 Difference]: Finished difference Result 2810 states and 3908 transitions. [2025-03-17 19:14:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 19:14:55,926 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 12.588235294117647) internal successors, (214), 15 states have internal predecessors, (214), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) Word has length 80 [2025-03-17 19:14:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:55,935 INFO L225 Difference]: With dead ends: 2810 [2025-03-17 19:14:55,936 INFO L226 Difference]: Without dead ends: 2808 [2025-03-17 19:14:55,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 19:14:55,938 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 3387 mSDsluCounter, 7728 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3397 SdHoareTripleChecker+Valid, 8278 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:55,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3397 Valid, 8278 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 19:14:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2025-03-17 19:14:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2327. [2025-03-17 19:14:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2239 states have (on average 1.3966056275122822) internal successors, (3127), 2258 states have internal predecessors, (3127), 56 states have call successors, (56), 23 states have call predecessors, (56), 18 states have return successors, (79), 45 states have call predecessors, (79), 56 states have call successors, (79) [2025-03-17 19:14:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3262 transitions. [2025-03-17 19:14:55,994 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3262 transitions. Word has length 80 [2025-03-17 19:14:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:55,994 INFO L471 AbstractCegarLoop]: Abstraction has 2327 states and 3262 transitions. [2025-03-17 19:14:55,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 12.588235294117647) internal successors, (214), 15 states have internal predecessors, (214), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 19:14:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3262 transitions. [2025-03-17 19:14:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:14:55,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:55,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:56,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:14:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:56,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1741030598, now seen corresponding path program 1 times [2025-03-17 19:14:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162501175] [2025-03-17 19:14:56,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:56,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:14:56,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:14:56,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:56,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162501175] [2025-03-17 19:14:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162501175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:14:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346891065] [2025-03-17 19:14:56,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:56,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:14:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:56,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:14:56,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:56,301 INFO L87 Difference]: Start difference. First operand 2327 states and 3262 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:56,476 INFO L93 Difference]: Finished difference Result 4711 states and 6624 transitions. [2025-03-17 19:14:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2025-03-17 19:14:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:56,485 INFO L225 Difference]: With dead ends: 4711 [2025-03-17 19:14:56,486 INFO L226 Difference]: Without dead ends: 2392 [2025-03-17 19:14:56,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:56,490 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 295 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:56,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1133 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-17 19:14:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2381. [2025-03-17 19:14:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2300 states have (on average 1.4052173913043478) internal successors, (3232), 2318 states have internal predecessors, (3232), 50 states have call successors, (50), 21 states have call predecessors, (50), 17 states have return successors, (72), 41 states have call predecessors, (72), 50 states have call successors, (72) [2025-03-17 19:14:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3354 transitions. [2025-03-17 19:14:56,548 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3354 transitions. Word has length 79 [2025-03-17 19:14:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:56,548 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 3354 transitions. [2025-03-17 19:14:56,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3354 transitions. [2025-03-17 19:14:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 19:14:56,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:56,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:56,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:14:56,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1139951992, now seen corresponding path program 1 times [2025-03-17 19:14:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771993965] [2025-03-17 19:14:56,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:56,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 19:14:56,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 19:14:56,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:56,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:14:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771993965] [2025-03-17 19:14:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771993965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74831292] [2025-03-17 19:14:56,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:56,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:56,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:56,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:56,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:14:56,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 19:14:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 19:14:56,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:56,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:56,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:14:56,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:57,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:14:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:14:57,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74831292] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:57,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 19:14:57,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 4] total 12 [2025-03-17 19:14:57,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858092975] [2025-03-17 19:14:57,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:57,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:14:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:57,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:14:57,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:14:57,241 INFO L87 Difference]: Start difference. First operand 2381 states and 3354 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:14:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:57,337 INFO L93 Difference]: Finished difference Result 2381 states and 3354 transitions. [2025-03-17 19:14:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 89 [2025-03-17 19:14:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:57,348 INFO L225 Difference]: With dead ends: 2381 [2025-03-17 19:14:57,348 INFO L226 Difference]: Without dead ends: 2380 [2025-03-17 19:14:57,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:14:57,350 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 961 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:57,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 493 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-17 19:14:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2025-03-17 19:14:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2300 states have (on average 1.4030434782608696) internal successors, (3227), 2317 states have internal predecessors, (3227), 50 states have call successors, (50), 21 states have call predecessors, (50), 17 states have return successors, (72), 41 states have call predecessors, (72), 50 states have call successors, (72) [2025-03-17 19:14:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3349 transitions. [2025-03-17 19:14:57,421 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3349 transitions. Word has length 89 [2025-03-17 19:14:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:57,422 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3349 transitions. [2025-03-17 19:14:57,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:14:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3349 transitions. [2025-03-17 19:14:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 19:14:57,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:57,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:57,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:14:57,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:57,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:57,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash 978773380, now seen corresponding path program 1 times [2025-03-17 19:14:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:57,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493176641] [2025-03-17 19:14:57,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:57,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 19:14:57,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 19:14:57,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:57,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:14:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493176641] [2025-03-17 19:14:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493176641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650118686] [2025-03-17 19:14:57,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:57,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:57,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:57,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:14:58,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 19:14:58,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 19:14:58,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:58,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:58,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:14:58,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:58,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:14:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:14:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650118686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:14:58,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:14:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2025-03-17 19:14:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120181034] [2025-03-17 19:14:58,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:14:58,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:14:58,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:58,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:14:58,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:14:58,346 INFO L87 Difference]: Start difference. First operand 2380 states and 3349 transitions. Second operand has 13 states, 12 states have (on average 18.75) internal successors, (225), 13 states have internal predecessors, (225), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 19:14:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:58,902 INFO L93 Difference]: Finished difference Result 4720 states and 6646 transitions. [2025-03-17 19:14:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:14:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 18.75) internal successors, (225), 13 states have internal predecessors, (225), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 90 [2025-03-17 19:14:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:58,919 INFO L225 Difference]: With dead ends: 4720 [2025-03-17 19:14:58,919 INFO L226 Difference]: Without dead ends: 4719 [2025-03-17 19:14:58,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:14:58,922 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2037 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:58,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2045 Valid, 3409 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:14:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2025-03-17 19:14:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4342. [2025-03-17 19:14:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4342 states, 4186 states have (on average 1.4025322503583373) internal successors, (5871), 4206 states have internal predecessors, (5871), 99 states have call successors, (99), 50 states have call predecessors, (99), 44 states have return successors, (137), 85 states have call predecessors, (137), 99 states have call successors, (137) [2025-03-17 19:14:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4342 states to 4342 states and 6107 transitions. [2025-03-17 19:14:59,026 INFO L78 Accepts]: Start accepts. Automaton has 4342 states and 6107 transitions. Word has length 90 [2025-03-17 19:14:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:59,026 INFO L471 AbstractCegarLoop]: Abstraction has 4342 states and 6107 transitions. [2025-03-17 19:14:59,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 18.75) internal successors, (225), 13 states have internal predecessors, (225), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 19:14:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4342 states and 6107 transitions. [2025-03-17 19:14:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 19:14:59,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:59,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:59,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:14:59,228 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,SelfDestructingSolverStorable10 [2025-03-17 19:14:59,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:59,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:59,228 INFO L85 PathProgramCache]: Analyzing trace with hash 635402849, now seen corresponding path program 1 times [2025-03-17 19:14:59,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:59,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442137205] [2025-03-17 19:14:59,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:59,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 19:14:59,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 19:14:59,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:59,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:14:59,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:59,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442137205] [2025-03-17 19:14:59,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442137205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:59,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:59,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:14:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774991930] [2025-03-17 19:14:59,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:59,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:59,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:59,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:59,488 INFO L87 Difference]: Start difference. First operand 4342 states and 6107 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:59,698 INFO L93 Difference]: Finished difference Result 5852 states and 8290 transitions. [2025-03-17 19:14:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:59,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 115 [2025-03-17 19:14:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:59,714 INFO L225 Difference]: With dead ends: 5852 [2025-03-17 19:14:59,714 INFO L226 Difference]: Without dead ends: 5850 [2025-03-17 19:14:59,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:59,717 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 389 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:59,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1409 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2025-03-17 19:14:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 4508. [2025-03-17 19:14:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4508 states, 4343 states have (on average 1.3969606262951877) internal successors, (6067), 4364 states have internal predecessors, (6067), 108 states have call successors, (108), 50 states have call predecessors, (108), 44 states have return successors, (149), 93 states have call predecessors, (149), 108 states have call successors, (149) [2025-03-17 19:14:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 6324 transitions. [2025-03-17 19:14:59,870 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 6324 transitions. Word has length 115 [2025-03-17 19:14:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:59,870 INFO L471 AbstractCegarLoop]: Abstraction has 4508 states and 6324 transitions. [2025-03-17 19:14:59,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 6324 transitions. [2025-03-17 19:14:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 19:14:59,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:59,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:14:59,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:14:59,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:14:59,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -258285576, now seen corresponding path program 1 times [2025-03-17 19:14:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891640903] [2025-03-17 19:14:59,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:59,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 19:14:59,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 19:14:59,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:59,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:15:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891640903] [2025-03-17 19:15:00,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891640903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69233103] [2025-03-17 19:15:00,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:00,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:00,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:00,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:00,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:15:00,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 19:15:00,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 19:15:00,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:00,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:00,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:15:00,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:15:00,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69233103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:00,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:00,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-17 19:15:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848080519] [2025-03-17 19:15:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:00,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:15:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:00,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:15:00,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:15:00,519 INFO L87 Difference]: Start difference. First operand 4508 states and 6324 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:15:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:00,818 INFO L93 Difference]: Finished difference Result 8501 states and 11975 transitions. [2025-03-17 19:15:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:15:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2025-03-17 19:15:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:00,837 INFO L225 Difference]: With dead ends: 8501 [2025-03-17 19:15:00,837 INFO L226 Difference]: Without dead ends: 4305 [2025-03-17 19:15:00,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:15:00,845 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 84 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:00,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 2314 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:15:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4305 states. [2025-03-17 19:15:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4305 to 4305. [2025-03-17 19:15:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4157 states have (on average 1.401972576377195) internal successors, (5828), 4176 states have internal predecessors, (5828), 97 states have call successors, (97), 44 states have call predecessors, (97), 38 states have return successors, (132), 84 states have call predecessors, (132), 97 states have call successors, (132) [2025-03-17 19:15:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 6057 transitions. [2025-03-17 19:15:00,972 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 6057 transitions. Word has length 122 [2025-03-17 19:15:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:00,972 INFO L471 AbstractCegarLoop]: Abstraction has 4305 states and 6057 transitions. [2025-03-17 19:15:00,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:15:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 6057 transitions. [2025-03-17 19:15:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 19:15:00,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:00,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:00,983 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-17 19:15:01,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:01,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:01,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1743599207, now seen corresponding path program 1 times [2025-03-17 19:15:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:01,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844593856] [2025-03-17 19:15:01,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:01,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 19:15:01,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 19:15:01,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:01,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:15:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844593856] [2025-03-17 19:15:01,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844593856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497811644] [2025-03-17 19:15:01,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:01,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:01,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:01,539 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-17 19:15:01,540 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-17 19:15:01,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 19:15:01,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 19:15:01,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:01,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:01,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:15:01,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:01,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:15:01,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:15:01,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 19:15:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:15:02,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497811644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:02,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:02,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2025-03-17 19:15:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883784304] [2025-03-17 19:15:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:02,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:15:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:02,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:15:02,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:15:02,405 INFO L87 Difference]: Start difference. First operand 4305 states and 6057 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:15:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:03,577 INFO L93 Difference]: Finished difference Result 9922 states and 14033 transitions. [2025-03-17 19:15:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:15:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 127 [2025-03-17 19:15:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:03,591 INFO L225 Difference]: With dead ends: 9922 [2025-03-17 19:15:03,591 INFO L226 Difference]: Without dead ends: 5661 [2025-03-17 19:15:03,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-17 19:15:03,600 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 596 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:03,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2914 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 19:15:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2025-03-17 19:15:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 4305. [2025-03-17 19:15:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4157 states have (on average 1.4017320182824151) internal successors, (5827), 4176 states have internal predecessors, (5827), 97 states have call successors, (97), 44 states have call predecessors, (97), 38 states have return successors, (132), 84 states have call predecessors, (132), 97 states have call successors, (132) [2025-03-17 19:15:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 6056 transitions. [2025-03-17 19:15:03,701 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 6056 transitions. Word has length 127 [2025-03-17 19:15:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:03,702 INFO L471 AbstractCegarLoop]: Abstraction has 4305 states and 6056 transitions. [2025-03-17 19:15:03,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:15:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 6056 transitions. [2025-03-17 19:15:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 19:15:03,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:03,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:03,712 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-17 19:15:03,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:03,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:03,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1022554767, now seen corresponding path program 1 times [2025-03-17 19:15:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692351198] [2025-03-17 19:15:03,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:03,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 19:15:04,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 19:15:04,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:04,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:15:04,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692351198] [2025-03-17 19:15:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692351198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217391756] [2025-03-17 19:15:04,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:04,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:04,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:04,243 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-17 19:15:04,244 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-17 19:15:04,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 19:15:04,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 19:15:04,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:04,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:04,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:15:04,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:15:04,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217391756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:04,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:04,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2025-03-17 19:15:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027607592] [2025-03-17 19:15:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:04,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:15:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:04,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:15:04,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:15:04,703 INFO L87 Difference]: Start difference. First operand 4305 states and 6056 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:15:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:04,860 INFO L93 Difference]: Finished difference Result 8530 states and 12038 transitions. [2025-03-17 19:15:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:15:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 128 [2025-03-17 19:15:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:04,871 INFO L225 Difference]: With dead ends: 8530 [2025-03-17 19:15:04,871 INFO L226 Difference]: Without dead ends: 4332 [2025-03-17 19:15:04,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:15:04,879 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 6 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:04,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2427 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:15:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2025-03-17 19:15:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4332. [2025-03-17 19:15:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4332 states, 4176 states have (on average 1.4018199233716475) internal successors, (5854), 4203 states have internal predecessors, (5854), 97 states have call successors, (97), 44 states have call predecessors, (97), 46 states have return successors, (146), 84 states have call predecessors, (146), 97 states have call successors, (146) [2025-03-17 19:15:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 6097 transitions. [2025-03-17 19:15:04,985 INFO L78 Accepts]: Start accepts. Automaton has 4332 states and 6097 transitions. Word has length 128 [2025-03-17 19:15:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:04,985 INFO L471 AbstractCegarLoop]: Abstraction has 4332 states and 6097 transitions. [2025-03-17 19:15:04,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:15:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 6097 transitions. [2025-03-17 19:15:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 19:15:04,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:04,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:04,996 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-17 19:15:05,187 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,SelfDestructingSolverStorable14 [2025-03-17 19:15:05,187 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:05,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1181637845, now seen corresponding path program 1 times [2025-03-17 19:15:05,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:05,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104728479] [2025-03-17 19:15:05,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:05,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:05,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 19:15:05,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 19:15:05,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:05,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:15:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104728479] [2025-03-17 19:15:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104728479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151079505] [2025-03-17 19:15:05,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:05,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:05,505 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-17 19:15:05,508 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-17 19:15:05,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 19:15:05,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 19:15:05,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:05,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:15:05,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:15:05,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:15:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:15:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151079505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:15:06,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:15:06,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 17 [2025-03-17 19:15:06,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387797547] [2025-03-17 19:15:06,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:15:06,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 19:15:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:06,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:15:06,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:15:06,143 INFO L87 Difference]: Start difference. First operand 4332 states and 6097 transitions. Second operand has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 19:15:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:06,696 INFO L93 Difference]: Finished difference Result 6990 states and 9839 transitions. [2025-03-17 19:15:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 19:15:06,697 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 130 [2025-03-17 19:15:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:06,703 INFO L225 Difference]: With dead ends: 6990 [2025-03-17 19:15:06,703 INFO L226 Difference]: Without dead ends: 2733 [2025-03-17 19:15:06,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:15:06,708 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 31 mSDsluCounter, 6276 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6763 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:06,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6763 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:15:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-17 19:15:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2716. [2025-03-17 19:15:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2613 states have (on average 1.4022196708763872) internal successors, (3664), 2626 states have internal predecessors, (3664), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-17 19:15:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3779 transitions. [2025-03-17 19:15:06,762 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3779 transitions. Word has length 130 [2025-03-17 19:15:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:06,763 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 3779 transitions. [2025-03-17 19:15:06,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 19:15:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3779 transitions. [2025-03-17 19:15:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 19:15:06,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:06,764 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:06,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 19:15:06,964 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,SelfDestructingSolverStorable15 [2025-03-17 19:15:06,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:06,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1234069871, now seen corresponding path program 2 times [2025-03-17 19:15:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712732383] [2025-03-17 19:15:06,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:15:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:07,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-17 19:15:07,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 19:15:07,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:15:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:15:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712732383] [2025-03-17 19:15:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712732383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281633803] [2025-03-17 19:15:07,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:15:07,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:07,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:07,406 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-17 19:15:07,410 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-17 19:15:07,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-17 19:15:07,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 134 statements. [2025-03-17 19:15:07,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:15:07,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:07,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:15:07,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:07,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:15:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 19:15:07,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281633803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-17 19:15:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171102960] [2025-03-17 19:15:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:15:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:07,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:15:07,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:15:07,689 INFO L87 Difference]: Start difference. First operand 2716 states and 3779 transitions. Second operand has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:15:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:07,769 INFO L93 Difference]: Finished difference Result 2716 states and 3779 transitions. [2025-03-17 19:15:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:15:07,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 134 [2025-03-17 19:15:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:07,777 INFO L225 Difference]: With dead ends: 2716 [2025-03-17 19:15:07,777 INFO L226 Difference]: Without dead ends: 2715 [2025-03-17 19:15:07,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:15:07,778 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 1 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:07,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 982 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:15:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-03-17 19:15:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2715. [2025-03-17 19:15:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2613 states have (on average 1.3999234596249521) internal successors, (3658), 2625 states have internal predecessors, (3658), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-17 19:15:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3773 transitions. [2025-03-17 19:15:07,830 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3773 transitions. Word has length 134 [2025-03-17 19:15:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:07,830 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3773 transitions. [2025-03-17 19:15:07,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:15:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3773 transitions. [2025-03-17 19:15:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 19:15:07,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:07,831 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:07,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 19:15:08,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 19:15:08,032 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:08,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash -398538975, now seen corresponding path program 1 times [2025-03-17 19:15:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320153765] [2025-03-17 19:15:08,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:08,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 19:15:08,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 19:15:08,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:08,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:15:08,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:08,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320153765] [2025-03-17 19:15:08,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320153765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:08,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823522321] [2025-03-17 19:15:08,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:08,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:08,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:08,548 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:08,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 19:15:08,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 19:15:08,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 19:15:08,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:08,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:08,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:15:08,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:15:09,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:15:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:15:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823522321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:15:09,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:15:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 27 [2025-03-17 19:15:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088828328] [2025-03-17 19:15:09,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:15:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 19:15:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:09,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 19:15:09,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-17 19:15:09,296 INFO L87 Difference]: Start difference. First operand 2715 states and 3773 transitions. Second operand has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 19:15:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:10,373 INFO L93 Difference]: Finished difference Result 5411 states and 7559 transitions. [2025-03-17 19:15:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 19:15:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2025-03-17 19:15:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:10,381 INFO L225 Difference]: With dead ends: 5411 [2025-03-17 19:15:10,382 INFO L226 Difference]: Without dead ends: 2785 [2025-03-17 19:15:10,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 19:15:10,384 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 57 mSDsluCounter, 7061 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 7536 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:10,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 7536 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:15:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2025-03-17 19:15:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2760. [2025-03-17 19:15:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 2658 states have (on average 1.3942814145974416) internal successors, (3706), 2670 states have internal predecessors, (3706), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-17 19:15:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3821 transitions. [2025-03-17 19:15:10,440 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3821 transitions. Word has length 135 [2025-03-17 19:15:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:10,440 INFO L471 AbstractCegarLoop]: Abstraction has 2760 states and 3821 transitions. [2025-03-17 19:15:10,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 19:15:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3821 transitions. [2025-03-17 19:15:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 19:15:10,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:10,442 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:10,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:15:10,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 19:15:10,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:10,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -928034212, now seen corresponding path program 2 times [2025-03-17 19:15:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:10,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962896479] [2025-03-17 19:15:10,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:15:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:10,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-17 19:15:10,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 19:15:10,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:15:10,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 125 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 19:15:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962896479] [2025-03-17 19:15:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962896479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910136749] [2025-03-17 19:15:11,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:15:11,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:11,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:11,388 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 19:15:11,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-17 19:15:11,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 19:15:11,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:15:11,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:11,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 19:15:11,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 11 proven. 128 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:15:12,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:15:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 77 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-17 19:15:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910136749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:15:12,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:15:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 10] total 39 [2025-03-17 19:15:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060598183] [2025-03-17 19:15:12,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:15:12,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 19:15:12,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:12,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 19:15:12,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 19:15:12,651 INFO L87 Difference]: Start difference. First operand 2760 states and 3821 transitions. Second operand has 39 states, 39 states have (on average 4.17948717948718) internal successors, (163), 39 states have internal predecessors, (163), 3 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 19:15:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:14,603 INFO L93 Difference]: Finished difference Result 5536 states and 7729 transitions. [2025-03-17 19:15:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-17 19:15:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.17948717948718) internal successors, (163), 39 states have internal predecessors, (163), 3 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 144 [2025-03-17 19:15:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:14,611 INFO L225 Difference]: With dead ends: 5536 [2025-03-17 19:15:14,611 INFO L226 Difference]: Without dead ends: 2871 [2025-03-17 19:15:14,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=850, Invalid=4552, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 19:15:14,616 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 45 mSDsluCounter, 9641 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10126 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:14,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10126 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 19:15:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2025-03-17 19:15:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2819. [2025-03-17 19:15:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2717 states have (on average 1.3860875966139123) internal successors, (3766), 2728 states have internal predecessors, (3766), 54 states have call successors, (54), 43 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-17 19:15:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3881 transitions. [2025-03-17 19:15:14,701 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3881 transitions. Word has length 144 [2025-03-17 19:15:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:14,703 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3881 transitions. [2025-03-17 19:15:14,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.17948717948718) internal successors, (163), 39 states have internal predecessors, (163), 3 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 19:15:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3881 transitions. [2025-03-17 19:15:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 19:15:14,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:14,704 INFO L218 NwaCegarLoop]: trace histogram [28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:14,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:15:14,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:14,905 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:14,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash 250755653, now seen corresponding path program 3 times [2025-03-17 19:15:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601501607] [2025-03-17 19:15:14,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:15:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:14,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 11 equivalence classes. [2025-03-17 19:15:14,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 106 of 157 statements. [2025-03-17 19:15:14,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:15:14,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-17 19:15:15,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601501607] [2025-03-17 19:15:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601501607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:15,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:15:15,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:15:15,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500264072] [2025-03-17 19:15:15,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:15,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:15:15,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:15,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:15:15,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:15:15,126 INFO L87 Difference]: Start difference. First operand 2819 states and 3881 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 19:15:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:15,330 INFO L93 Difference]: Finished difference Result 5594 states and 7712 transitions. [2025-03-17 19:15:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:15:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 157 [2025-03-17 19:15:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:15,337 INFO L225 Difference]: With dead ends: 5594 [2025-03-17 19:15:15,337 INFO L226 Difference]: Without dead ends: 2819 [2025-03-17 19:15:15,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:15:15,340 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 17 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:15,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1343 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:15:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2025-03-17 19:15:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2819. [2025-03-17 19:15:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2717 states have (on average 1.3835112256164888) internal successors, (3759), 2728 states have internal predecessors, (3759), 54 states have call successors, (54), 43 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-17 19:15:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3874 transitions. [2025-03-17 19:15:15,418 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3874 transitions. Word has length 157 [2025-03-17 19:15:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:15,418 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3874 transitions. [2025-03-17 19:15:15,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 19:15:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3874 transitions. [2025-03-17 19:15:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 19:15:15,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:15,419 INFO L218 NwaCegarLoop]: trace histogram [28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:15,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 19:15:15,420 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:15,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1918035544, now seen corresponding path program 1 times [2025-03-17 19:15:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:15,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421678658] [2025-03-17 19:15:15,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:15,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 19:15:15,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 19:15:15,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:15,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-17 19:15:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421678658] [2025-03-17 19:15:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421678658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:15,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:15:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:15:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113469178] [2025-03-17 19:15:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:15:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:15,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:15:15,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:15:15,753 INFO L87 Difference]: Start difference. First operand 2819 states and 3874 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 19:15:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:15,994 INFO L93 Difference]: Finished difference Result 5612 states and 7729 transitions. [2025-03-17 19:15:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:15:15,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 158 [2025-03-17 19:15:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:16,002 INFO L225 Difference]: With dead ends: 5612 [2025-03-17 19:15:16,002 INFO L226 Difference]: Without dead ends: 2840 [2025-03-17 19:15:16,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:15:16,006 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 8 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:16,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1766 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:15:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2025-03-17 19:15:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2840. [2025-03-17 19:15:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2738 states have (on average 1.3805697589481374) internal successors, (3780), 2749 states have internal predecessors, (3780), 54 states have call successors, (54), 43 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-17 19:15:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3895 transitions. [2025-03-17 19:15:16,090 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3895 transitions. Word has length 158 [2025-03-17 19:15:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:16,090 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 3895 transitions. [2025-03-17 19:15:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 19:15:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3895 transitions. [2025-03-17 19:15:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 19:15:16,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:16,091 INFO L218 NwaCegarLoop]: trace histogram [28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:16,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 19:15:16,092 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 47309153, now seen corresponding path program 1 times [2025-03-17 19:15:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97994523] [2025-03-17 19:15:16,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:16,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 19:15:16,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:15:16,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-17 19:15:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97994523] [2025-03-17 19:15:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97994523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:15:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:15:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93221291] [2025-03-17 19:15:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:15:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:16,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:15:16,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:15:16,394 INFO L87 Difference]: Start difference. First operand 2840 states and 3895 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 19:15:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:16,726 INFO L93 Difference]: Finished difference Result 5658 states and 7778 transitions. [2025-03-17 19:15:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:15:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 159 [2025-03-17 19:15:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:16,733 INFO L225 Difference]: With dead ends: 5658 [2025-03-17 19:15:16,733 INFO L226 Difference]: Without dead ends: 2875 [2025-03-17 19:15:16,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:15:16,737 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 12 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:16,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2576 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:15:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2025-03-17 19:15:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2868. [2025-03-17 19:15:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2766 states have (on average 1.3792480115690529) internal successors, (3815), 2777 states have internal predecessors, (3815), 54 states have call successors, (54), 43 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-17 19:15:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 3930 transitions. [2025-03-17 19:15:16,803 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 3930 transitions. Word has length 159 [2025-03-17 19:15:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:16,803 INFO L471 AbstractCegarLoop]: Abstraction has 2868 states and 3930 transitions. [2025-03-17 19:15:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 19:15:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 3930 transitions. [2025-03-17 19:15:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 19:15:16,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:16,805 INFO L218 NwaCegarLoop]: trace histogram [28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:15:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 19:15:16,805 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 19:15:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1586856877, now seen corresponding path program 1 times [2025-03-17 19:15:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828450529] [2025-03-17 19:15:16,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:16,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 19:15:17,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:15:17,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:17,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 286 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-17 19:15:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828450529] [2025-03-17 19:15:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828450529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252167313] [2025-03-17 19:15:17,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:17,704 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:17,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 19:15:18,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 19:15:19,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:15:19,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:19,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:19,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 324 conjuncts are in the unsatisfiable core [2025-03-17 19:15:19,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:19,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:15:19,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:15:19,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:15:19,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 19:15:19,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 19:15:19,854 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 19:15:19,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 19:15:19,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:15:19,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:15:19,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 19:15:19,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 19:15:20,483 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 19:15:20,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 19:15:20,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 19:15:20,560 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2411 treesize of output 2030 [2025-03-17 19:15:20,582 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2025-03-17 19:15:20,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1384 treesize of output 1087 [2025-03-17 19:15:20,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 19:15:20,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 8 [2025-03-17 19:15:20,616 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2618 treesize of output 2205 [2025-03-17 19:15:20,636 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2592 treesize of output 2185 [2025-03-17 19:15:20,651 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-03-17 19:15:20,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1358 treesize of output 1 [2025-03-17 19:15:20,666 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2385 treesize of output 2010 [2025-03-17 19:15:20,731 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2411 treesize of output 2030 [2025-03-17 19:15:20,742 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-03-17 19:15:20,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1384 treesize of output 1 [2025-03-17 19:15:20,757 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2618 treesize of output 2205 [2025-03-17 19:15:20,780 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2256 treesize of output 1915 [2025-03-17 19:15:20,797 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:15:20,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2049 treesize of output 1740 [2025-03-17 19:15:20,807 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-03-17 19:15:20,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1170 treesize of output 1 [2025-03-17 19:15:20,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:15:20,990 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 19:15:20,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 19:15:21,091 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 19:15:21,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 73 [2025-03-17 19:15:21,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:15:21,098 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 19:15:21,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2025-03-17 19:15:21,121 INFO L349 Elim1Store]: treesize reduction 137, result has 9.9 percent of original size [2025-03-17 19:15:21,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 227 treesize of output 148 [2025-03-17 19:15:21,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:15:21,140 INFO L349 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2025-03-17 19:15:21,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 64 [2025-03-17 19:16:06,737 INFO L349 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2025-03-17 19:16:06,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 136 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 233 [2025-03-17 19:16:06,779 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-03-17 19:16:06,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 140 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 290 [2025-03-17 19:16:09,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,952 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 19:16:09,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:09,973 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2025-03-17 19:16:09,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 136 disjoint index pairs (out of 190 index pairs), introduced 22 new quantified variables, introduced 190 case distinctions, treesize of input 636 treesize of output 382 [2025-03-17 19:16:10,027 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-03-17 19:16:10,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 139 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 1 case distinctions, treesize of input 313 treesize of output 357 [2025-03-17 19:16:13,431 INFO L349 Elim1Store]: treesize reduction 86, result has 5.5 percent of original size [2025-03-17 19:16:13,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 687 treesize of output 337 [2025-03-17 19:16:13,446 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 19:16:13,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 215 [2025-03-17 19:16:13,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 139 disjoint index pairs (out of 171 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 235 [2025-03-17 19:16:13,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:16:13,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 123 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 58 [2025-03-17 19:16:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 11 proven. 414 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 19:16:14,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:16:14,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse7 (mod |c_ULTIMATE.start_main_~_ha_bkt~0#1| 4294967296)) (.cse0 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse4 (select |c_#memory_$Pointer$#3.base| .cse0)) (.cse1 (select |c_#memory_$Pointer$#3.offset| .cse0)) (.cse5 (* .cse7 12)) (.cse6 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (let ((.cse2 (+ .cse5 .cse6 (- 51539607548))) (.cse3 (+ (- 51539607552) .cse5 .cse6))) (and (forall ((v_ArrVal_5425 (Array Int Int)) (v_ArrVal_5422 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 (store .cse1 .cse2 v_ArrVal_5422)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5425) .cse0) .cse3) 0)) (forall ((v_ArrVal_5424 (Array Int Int))) (or (not (= v_ArrVal_5424 (store .cse4 .cse2 (select v_ArrVal_5424 .cse2)))) (forall ((v_ArrVal_5421 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5424) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5421) .cse0) .cse3) 0)))))) (< .cse7 2147483648)) (or (< 2147483647 .cse7) (let ((.cse8 (+ .cse5 .cse6 4)) (.cse9 (+ .cse5 .cse6))) (and (forall ((v_ArrVal_5424 (Array Int Int))) (or (not (= (store .cse4 .cse8 (select v_ArrVal_5424 .cse8)) v_ArrVal_5424)) (forall ((v_ArrVal_5421 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5424) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5421) .cse0) .cse9) 0)))) (forall ((v_ArrVal_5425 (Array Int Int)) (v_ArrVal_5422 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 (store .cse1 .cse8 v_ArrVal_5422)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5425) .cse0) .cse9) 0)))))))))) is different from false [2025-03-17 19:16:14,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse7 (mod |c_ULTIMATE.start_main_#t~bitwise115#1| 4294967296)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse4 (select |c_#memory_$Pointer$#3.offset| .cse2)) (.cse0 (select |c_#memory_$Pointer$#3.base| .cse2)) (.cse5 (* .cse7 12)) (.cse6 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (let ((.cse1 (+ .cse5 .cse6 (- 51539607548))) (.cse3 (+ .cse5 (- 51539607552) .cse6))) (and (forall ((v_ArrVal_5424 (Array Int Int))) (or (not (= v_ArrVal_5424 (store .cse0 .cse1 (select v_ArrVal_5424 .cse1)))) (forall ((v_ArrVal_5421 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse2 v_ArrVal_5424) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5421) .cse2) .cse3) 0)))) (forall ((v_ArrVal_5425 (Array Int Int)) (v_ArrVal_5422 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse2 (store .cse4 .cse1 v_ArrVal_5422)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5425) .cse2) .cse3) 0)))) (< .cse7 2147483648)) (or (< 2147483647 .cse7) (let ((.cse9 (+ .cse5 .cse6)) (.cse8 (+ .cse5 .cse6 4))) (and (forall ((v_ArrVal_5425 (Array Int Int)) (v_ArrVal_5422 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse2 (store .cse4 .cse8 v_ArrVal_5422)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5425) .cse2) .cse9) 0)) (forall ((v_ArrVal_5424 (Array Int Int))) (or (forall ((v_ArrVal_5421 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$#3.base| .cse2 v_ArrVal_5424) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5421) .cse2) .cse9))) (not (= (store .cse0 .cse8 (select v_ArrVal_5424 .cse8)) v_ArrVal_5424)))))))))))) is different from false [2025-03-17 19:16:14,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse5))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.offset| .cse3) .cse4))) (let ((.cse1 (+ .cse2 4)) (.cse0 (select (select |c_#memory_$Pointer$#3.base| .cse3) .cse4))) (and (forall ((v_ArrVal_5425 (Array Int Int)) (v_ArrVal_5422 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 (store (select |c_#memory_$Pointer$#3.offset| .cse0) .cse1 v_ArrVal_5422)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5425) .cse0) .cse2) 0)) (forall ((v_ArrVal_5424 (Array Int Int))) (or (not (= v_ArrVal_5424 (store (select |c_#memory_$Pointer$#3.base| .cse0) .cse1 (select v_ArrVal_5424 .cse1)))) (forall ((v_ArrVal_5421 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5424) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5421) .cse0) .cse2) 0))))))))) is different from false [2025-03-17 19:16:14,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse7))) (let ((.cse9 (select |c_#memory_$Pointer$#3.base| .cse8)) (.cse11 (select |c_#memory_$Pointer$#3.offset| .cse8)) (.cse10 (+ (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse7) 12))) (and (forall ((v_DerPreprocessor_24 Int) (v_ArrVal_5419 Int) (v_ArrVal_5421 (Array Int Int)) (v_ArrVal_5424 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#3.offset| .cse8 (store .cse11 .cse10 v_DerPreprocessor_24))) (.cse0 (store |c_#memory_$Pointer$#3.base| .cse8 (store .cse9 .cse10 v_ArrVal_5419)))) (let ((.cse5 (select (select .cse0 |c_ULTIMATE.start_main_~users~0#1.base|) .cse7)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~users~0#1.base|) .cse7))) (let ((.cse1 (select (select .cse0 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (or (not (= v_ArrVal_5424 (let ((.cse2 (+ .cse3 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_5424 .cse2))))) (= (select (select (store (store .cse0 .cse1 v_ArrVal_5424) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5421) .cse1) .cse3) 0)))))) (forall ((v_DerPreprocessor_24 Int) (v_ArrVal_5419 Int) (v_ArrVal_5425 (Array Int Int)) (v_ArrVal_5422 Int)) (= (let ((.cse12 (store |c_#memory_$Pointer$#3.offset| .cse8 (store .cse11 .cse10 v_DerPreprocessor_24))) (.cse15 (store |c_#memory_$Pointer$#3.base| .cse8 (store .cse9 .cse10 v_ArrVal_5419)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~users~0#1.base|) .cse7)) (.cse17 (select (select .cse12 |c_ULTIMATE.start_main_~users~0#1.base|) .cse7))) (let ((.cse14 (select (select .cse12 .cse16) .cse17))) (select (let ((.cse13 (select (select .cse15 .cse16) .cse17))) (select (store (store .cse12 .cse13 (store (select .cse12 .cse13) (+ .cse14 4) v_ArrVal_5422)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5425) .cse13)) .cse14)))) 0)))))) is different from false [2025-03-17 19:16:14,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse9 (select |c_#memory_$Pointer$#3.base| .cse8)) (.cse11 (select |c_#memory_$Pointer$#3.offset| .cse8)) (.cse10 (+ 12 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))) (and (forall ((v_DerPreprocessor_24 Int) (v_ArrVal_5419 Int) (v_ArrVal_5421 (Array Int Int)) (v_ArrVal_5424 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#3.offset| .cse8 (store .cse11 .cse10 v_DerPreprocessor_24))) (.cse0 (store |c_#memory_$Pointer$#3.base| .cse8 (store .cse9 .cse10 v_ArrVal_5419)))) (let ((.cse5 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse1 (select (select .cse0 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (or (not (= (let ((.cse2 (+ .cse3 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_5424 .cse2))) v_ArrVal_5424)) (= (select (select (store (store .cse0 .cse1 v_ArrVal_5424) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5421) .cse1) .cse3) 0)))))) (forall ((v_DerPreprocessor_24 Int) (v_ArrVal_5419 Int) (v_ArrVal_5425 (Array Int Int)) (v_ArrVal_5422 Int)) (= (let ((.cse12 (store |c_#memory_$Pointer$#3.offset| .cse8 (store .cse11 .cse10 v_DerPreprocessor_24))) (.cse15 (store |c_#memory_$Pointer$#3.base| .cse8 (store .cse9 .cse10 v_ArrVal_5419)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse17 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse14 (select (select .cse12 .cse16) .cse17))) (select (let ((.cse13 (select (select .cse15 .cse16) .cse17))) (select (store (store .cse12 .cse13 (store (select .cse12 .cse13) (+ .cse14 4) v_ArrVal_5422)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_5425) .cse13)) .cse14)))) 0)))))) is different from false